./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:12:53,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:12:53,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:12:53,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:12:53,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:12:53,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:12:53,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:12:53,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:12:53,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:12:53,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:12:53,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:12:53,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:12:53,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:12:53,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:12:53,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:12:53,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:12:53,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:12:53,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:12:53,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:12:53,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:12:53,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:12:53,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:12:53,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:12:53,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:12:53,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:12:53,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:12:53,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:12:53,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:12:53,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:12:53,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:12:53,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:12:53,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:12:53,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:12:53,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:12:53,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:12:53,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:12:53,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:12:53,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:12:53,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:12:53,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:12:53,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:12:53,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-20 23:12:53,480 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:12:53,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:12:53,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:12:53,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:12:53,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:12:53,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:12:53,483 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:12:53,483 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:12:53,483 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:12:53,484 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:12:53,484 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:12:53,484 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:12:53,484 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:12:53,485 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:12:53,485 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:12:53,485 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:12:53,485 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:12:53,486 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:12:53,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:12:53,487 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:12:53,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 23:12:53,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:12:53,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:12:53,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:12:53,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:12:53,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:12:53,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:12:53,489 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-20 23:12:53,489 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:12:53,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:12:53,489 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:12:53,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:12:53,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:12:53,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:12:53,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:12:53,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:12:53,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:12:53,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:12:53,491 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:12:53,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:12:53,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:12:53,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:12:53,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:12:53,492 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/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_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P 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 ! data-race) ) 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2021-11-20 23:12:53,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:12:53,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:12:53,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:12:53,850 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:12:53,851 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:12:53,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-20 23:12:53,959 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/data/83ba742a0/a2683cfa370a42cb80b27862835ce431/FLAGc987fe0f8 [2021-11-20 23:12:54,541 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:12:54,546 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-20 23:12:54,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/data/83ba742a0/a2683cfa370a42cb80b27862835ce431/FLAGc987fe0f8 [2021-11-20 23:12:54,800 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/data/83ba742a0/a2683cfa370a42cb80b27862835ce431 [2021-11-20 23:12:54,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:12:54,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:12:54,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:12:54,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:12:54,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:12:54,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:12:54" (1/1) ... [2021-11-20 23:12:54,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7742c392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:54, skipping insertion in model container [2021-11-20 23:12:54,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:12:54" (1/1) ... [2021-11-20 23:12:54,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:12:54,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:12:55,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:12:55,492 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:12:55,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:12:55,598 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:12:55,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55 WrapperNode [2021-11-20 23:12:55,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:12:55,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:12:55,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:12:55,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:12:55,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,670 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2021-11-20 23:12:55,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:12:55,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:12:55,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:12:55,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:12:55,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:12:55,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:12:55,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:12:55,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:12:55,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (1/1) ... [2021-11-20 23:12:55,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:12:55,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:12:55,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:12:55,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:12:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:12:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-20 23:12:55,836 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-20 23:12:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:12:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:12:55,838 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-20 23:12:56,036 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:12:56,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:12:56,297 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:12:56,305 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:12:56,306 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-20 23:12:56,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:12:56 BoogieIcfgContainer [2021-11-20 23:12:56,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:12:56,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:12:56,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:12:56,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:12:56,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:12:54" (1/3) ... [2021-11-20 23:12:56,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6460fc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:12:56, skipping insertion in model container [2021-11-20 23:12:56,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:12:55" (2/3) ... [2021-11-20 23:12:56,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6460fc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:12:56, skipping insertion in model container [2021-11-20 23:12:56,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:12:56" (3/3) ... [2021-11-20 23:12:56,330 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2021-11-20 23:12:56,337 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-20 23:12:56,337 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:12:56,337 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-20 23:12:56,337 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-20 23:12:56,403 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,404 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,405 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,406 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,407 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,408 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,409 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,410 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,411 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,412 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,413 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,414 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,416 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,444 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,447 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,449 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,450 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,451 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,457 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,458 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,481 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,482 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,482 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,485 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,486 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,487 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,487 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,488 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,488 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,488 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,488 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,488 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,489 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,489 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,490 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,491 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,492 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,493 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,496 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,497 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,498 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,499 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,504 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,505 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,506 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,507 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-20 23:12:56,511 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-20 23:12:56,574 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:12:56,584 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:12:56,585 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-20 23:12:56,605 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-20 23:12:56,624 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 106 transitions, 217 flow [2021-11-20 23:12:56,632 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 106 transitions, 217 flow [2021-11-20 23:12:56,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 106 transitions, 217 flow [2021-11-20 23:12:56,705 INFO L129 PetriNetUnfolder]: 6/105 cut-off events. [2021-11-20 23:12:56,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-20 23:12:56,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 136 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2021-11-20 23:12:56,717 INFO L116 LiptonReduction]: Number of co-enabled transitions 3192 [2021-11-20 23:12:58,720 INFO L131 LiptonReduction]: Checked pairs total: 8972 [2021-11-20 23:12:58,720 INFO L133 LiptonReduction]: Total number of compositions: 68 [2021-11-20 23:12:58,730 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2021-11-20 23:12:58,757 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 23:12:58,767 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:12:58,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:12:58,768 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:12:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:12:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1578252910, now seen corresponding path program 1 times [2021-11-20 23:12:58,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:12:58,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778786776] [2021-11-20 23:12:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:12:58,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:12:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:12:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:12:58,953 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:12:58,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778786776] [2021-11-20 23:12:58,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778786776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:12:58,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:12:58,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:12:58,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592700871] [2021-11-20 23:12:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:12:58,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:12:58,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:12:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:12:58,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:12:58,991 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:12:59,088 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2021-11-20 23:12:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:12:59,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-20 23:12:59,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:12:59,114 INFO L225 Difference]: With dead ends: 327 [2021-11-20 23:12:59,114 INFO L226 Difference]: Without dead ends: 327 [2021-11-20 23:12:59,115 INFO L932 BasicCegarLoop]: 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 [2021-11-20 23:12:59,118 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:12:59,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:12:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-20 23:12:59,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-11-20 23:12:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2021-11-20 23:12:59,196 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2021-11-20 23:12:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:12:59,197 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2021-11-20 23:12:59,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2021-11-20 23:12:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 23:12:59,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:12:59,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:12:59,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:12:59,199 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:12:59,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:12:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1431754540, now seen corresponding path program 1 times [2021-11-20 23:12:59,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:12:59,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763000215] [2021-11-20 23:12:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:12:59,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:12:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:12:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:12:59,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:12:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763000215] [2021-11-20 23:12:59,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763000215] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:12:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016575912] [2021-11-20 23:12:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:12:59,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:12:59,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:12:59,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:12:59,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:12:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:12:59,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 23:12:59,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:12:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:12:59,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:12:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:12:59,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016575912] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:12:59,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547941295] [2021-11-20 23:12:59,467 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:12:59,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:12:59,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-11-20 23:12:59,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932709730] [2021-11-20 23:12:59,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:12:59,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:12:59,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:12:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:12:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:12:59,471 INFO L87 Difference]: Start difference. First operand 327 states and 651 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:12:59,531 INFO L93 Difference]: Finished difference Result 330 states and 654 transitions. [2021-11-20 23:12:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:12:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 23:12:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:12:59,535 INFO L225 Difference]: With dead ends: 330 [2021-11-20 23:12:59,535 INFO L226 Difference]: Without dead ends: 330 [2021-11-20 23:12:59,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:12:59,541 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:12:59,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:12:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-20 23:12:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-20 23:12:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 322 states have (on average 2.031055900621118) internal successors, (654), 329 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 654 transitions. [2021-11-20 23:12:59,580 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 654 transitions. Word has length 12 [2021-11-20 23:12:59,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:12:59,581 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 654 transitions. [2021-11-20 23:12:59,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:12:59,581 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 654 transitions. [2021-11-20 23:12:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 23:12:59,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:12:59,583 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:12:59,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:12:59,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:12:59,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:12:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:12:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1488091630, now seen corresponding path program 2 times [2021-11-20 23:12:59,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:12:59,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80172549] [2021-11-20 23:12:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:12:59,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:12:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:12:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:12:59,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:12:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80172549] [2021-11-20 23:12:59,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80172549] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:12:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218254127] [2021-11-20 23:12:59,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:12:59,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:12:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:12:59,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:12:59,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 23:12:59,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:12:59,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:12:59,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 23:12:59,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:00,037 INFO L388 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 11 treesize of output 7 [2021-11-20 23:13:00,074 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-20 23:13:00,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 21 treesize of output 20 [2021-11-20 23:13:00,130 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-20 23:13:00,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:13:00,191 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-20 23:13:00,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:13:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:13:00,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:13:00,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218254127] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:00,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:13:00,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2021-11-20 23:13:00,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336160915] [2021-11-20 23:13:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:00,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:00,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:00,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:13:00,227 INFO L87 Difference]: Start difference. First operand 330 states and 654 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:00,515 INFO L93 Difference]: Finished difference Result 431 states and 856 transitions. [2021-11-20 23:13:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-20 23:13:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:00,519 INFO L225 Difference]: With dead ends: 431 [2021-11-20 23:13:00,519 INFO L226 Difference]: Without dead ends: 431 [2021-11-20 23:13:00,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:13:00,536 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:00,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 23:13:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-20 23:13:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 397. [2021-11-20 23:13:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 389 states have (on average 2.025706940874036) internal successors, (788), 396 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 788 transitions. [2021-11-20 23:13:00,568 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 788 transitions. Word has length 15 [2021-11-20 23:13:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:00,568 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 788 transitions. [2021-11-20 23:13:00,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 788 transitions. [2021-11-20 23:13:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 23:13:00,570 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:00,570 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:00,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:00,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-20 23:13:00,784 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1042957047, now seen corresponding path program 1 times [2021-11-20 23:13:00,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:00,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467152685] [2021-11-20 23:13:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:00,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:13:00,894 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:00,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467152685] [2021-11-20 23:13:00,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467152685] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:00,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842553227] [2021-11-20 23:13:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:00,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:00,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:00,896 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:00,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 23:13:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:00,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 23:13:00,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:13:01,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:13:01,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842553227] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:13:01,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600703955] [2021-11-20 23:13:01,114 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:13:01,115 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:13:01,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-20 23:13:01,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328726226] [2021-11-20 23:13:01,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:13:01,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-20 23:13:01,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 23:13:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:13:01,117 INFO L87 Difference]: Start difference. First operand 397 states and 788 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:01,211 INFO L93 Difference]: Finished difference Result 403 states and 794 transitions. [2021-11-20 23:13:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:13:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-20 23:13:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:01,215 INFO L225 Difference]: With dead ends: 403 [2021-11-20 23:13:01,215 INFO L226 Difference]: Without dead ends: 403 [2021-11-20 23:13:01,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:13:01,216 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:01,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-20 23:13:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2021-11-20 23:13:01,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 395 states have (on average 2.010126582278481) internal successors, (794), 402 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 794 transitions. [2021-11-20 23:13:01,231 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 794 transitions. Word has length 15 [2021-11-20 23:13:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:01,232 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 794 transitions. [2021-11-20 23:13:01,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 794 transitions. [2021-11-20 23:13:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-20 23:13:01,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:01,233 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:01,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:01,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:01,451 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -564794441, now seen corresponding path program 2 times [2021-11-20 23:13:01,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:01,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708254685] [2021-11-20 23:13:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:01,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:01,608 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:01,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708254685] [2021-11-20 23:13:01,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708254685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:01,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:01,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:13:01,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111838316] [2021-11-20 23:13:01,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:01,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:01,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:01,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:01,611 INFO L87 Difference]: Start difference. First operand 403 states and 794 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:01,836 INFO L93 Difference]: Finished difference Result 493 states and 974 transitions. [2021-11-20 23:13:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-20 23:13:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:01,840 INFO L225 Difference]: With dead ends: 493 [2021-11-20 23:13:01,841 INFO L226 Difference]: Without dead ends: 493 [2021-11-20 23:13:01,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:01,842 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:01,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 16 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:13:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-11-20 23:13:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 461. [2021-11-20 23:13:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 454 states have (on average 2.004405286343612) internal successors, (910), 460 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 910 transitions. [2021-11-20 23:13:01,860 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 910 transitions. Word has length 21 [2021-11-20 23:13:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:01,860 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 910 transitions. [2021-11-20 23:13:01,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 910 transitions. [2021-11-20 23:13:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:13:01,863 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:01,863 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:01,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 23:13:01,864 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash 116571226, now seen corresponding path program 1 times [2021-11-20 23:13:01,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:01,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042097038] [2021-11-20 23:13:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:01,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:02,034 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042097038] [2021-11-20 23:13:02,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042097038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:02,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:02,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:13:02,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756381227] [2021-11-20 23:13:02,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:02,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:02,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:02,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:02,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:02,038 INFO L87 Difference]: Start difference. First operand 461 states and 910 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:02,273 INFO L93 Difference]: Finished difference Result 527 states and 1042 transitions. [2021-11-20 23:13:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:02,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:13:02,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:02,277 INFO L225 Difference]: With dead ends: 527 [2021-11-20 23:13:02,277 INFO L226 Difference]: Without dead ends: 512 [2021-11-20 23:13:02,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:02,279 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:02,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:13:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-20 23:13:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2021-11-20 23:13:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 505 states have (on average 2.0) internal successors, (1010), 511 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1010 transitions. [2021-11-20 23:13:02,300 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1010 transitions. Word has length 27 [2021-11-20 23:13:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:02,300 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 1010 transitions. [2021-11-20 23:13:02,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1010 transitions. [2021-11-20 23:13:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-20 23:13:02,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:02,302 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:02,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 23:13:02,303 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash 566778797, now seen corresponding path program 1 times [2021-11-20 23:13:02,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:02,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818418231] [2021-11-20 23:13:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:02,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:02,401 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:02,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818418231] [2021-11-20 23:13:02,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818418231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:02,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:02,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:13:02,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299185662] [2021-11-20 23:13:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:02,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:02,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:02,403 INFO L87 Difference]: Start difference. First operand 512 states and 1010 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:02,604 INFO L93 Difference]: Finished difference Result 600 states and 1186 transitions. [2021-11-20 23:13:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-20 23:13:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:02,611 INFO L225 Difference]: With dead ends: 600 [2021-11-20 23:13:02,611 INFO L226 Difference]: Without dead ends: 584 [2021-11-20 23:13:02,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:02,612 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:02,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 16 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 23:13:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-11-20 23:13:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 562. [2021-11-20 23:13:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 555 states have (on average 1.9963963963963964) internal successors, (1108), 561 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1108 transitions. [2021-11-20 23:13:02,633 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1108 transitions. Word has length 27 [2021-11-20 23:13:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:02,633 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1108 transitions. [2021-11-20 23:13:02,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1108 transitions. [2021-11-20 23:13:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:13:02,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:02,635 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:02,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 23:13:02,636 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1553633119, now seen corresponding path program 1 times [2021-11-20 23:13:02,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936856256] [2021-11-20 23:13:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:02,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:02,882 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:02,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936856256] [2021-11-20 23:13:02,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936856256] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:02,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:13:02,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 23:13:02,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819235407] [2021-11-20 23:13:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:02,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:02,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:13:02,885 INFO L87 Difference]: Start difference. First operand 562 states and 1108 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:03,066 INFO L93 Difference]: Finished difference Result 1405 states and 2779 transitions. [2021-11-20 23:13:03,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2021-11-20 23:13:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:03,078 INFO L225 Difference]: With dead ends: 1405 [2021-11-20 23:13:03,078 INFO L226 Difference]: Without dead ends: 1405 [2021-11-20 23:13:03,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-11-20 23:13:03,079 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 135 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:03,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 92 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2021-11-20 23:13:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 589. [2021-11-20 23:13:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 582 states have (on average 1.9742268041237114) internal successors, (1149), 588 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1149 transitions. [2021-11-20 23:13:03,109 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1149 transitions. Word has length 31 [2021-11-20 23:13:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:03,110 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1149 transitions. [2021-11-20 23:13:03,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1149 transitions. [2021-11-20 23:13:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:13:03,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:03,112 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:03,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 23:13:03,112 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash 992145763, now seen corresponding path program 1 times [2021-11-20 23:13:03,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:03,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527873843] [2021-11-20 23:13:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:03,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-20 23:13:03,216 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:03,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527873843] [2021-11-20 23:13:03,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527873843] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:03,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303898670] [2021-11-20 23:13:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:03,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:03,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:03,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:03,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 23:13:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:03,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 23:13:03,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:03,421 INFO L388 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 [2021-11-20 23:13:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:03,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:13:03,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303898670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:03,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:13:03,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-20 23:13:03,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4466298] [2021-11-20 23:13:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:03,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:03,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:13:03,467 INFO L87 Difference]: Start difference. First operand 589 states and 1149 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:03,595 INFO L93 Difference]: Finished difference Result 1066 states and 2075 transitions. [2021-11-20 23:13:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:03,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2021-11-20 23:13:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:03,607 INFO L225 Difference]: With dead ends: 1066 [2021-11-20 23:13:03,607 INFO L226 Difference]: Without dead ends: 1066 [2021-11-20 23:13:03,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:13:03,608 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:03,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 128 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2021-11-20 23:13:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 603. [2021-11-20 23:13:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 596 states have (on average 1.9530201342281879) internal successors, (1164), 602 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1164 transitions. [2021-11-20 23:13:03,636 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1164 transitions. Word has length 31 [2021-11-20 23:13:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:03,636 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 1164 transitions. [2021-11-20 23:13:03,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1164 transitions. [2021-11-20 23:13:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:13:03,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:03,638 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:03,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:03,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:03,855 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1099506277, now seen corresponding path program 2 times [2021-11-20 23:13:03,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:03,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769265950] [2021-11-20 23:13:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:03,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-20 23:13:03,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:03,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769265950] [2021-11-20 23:13:03,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769265950] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:03,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002170537] [2021-11-20 23:13:03,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:13:03,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:03,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:03,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:04,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 23:13:04,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:13:04,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:04,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 23:13:04,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:04,114 INFO L388 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 [2021-11-20 23:13:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:04,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:13:04,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002170537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:04,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:13:04,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-20 23:13:04,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184513514] [2021-11-20 23:13:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:04,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:04,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:04,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:13:04,227 INFO L87 Difference]: Start difference. First operand 603 states and 1164 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:04,340 INFO L93 Difference]: Finished difference Result 1446 states and 2835 transitions. [2021-11-20 23:13:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 23:13:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2021-11-20 23:13:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:04,351 INFO L225 Difference]: With dead ends: 1446 [2021-11-20 23:13:04,352 INFO L226 Difference]: Without dead ends: 1446 [2021-11-20 23:13:04,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-20 23:13:04,353 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:04,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 122 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-11-20 23:13:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 617. [2021-11-20 23:13:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 610 states have (on average 1.9540983606557376) internal successors, (1192), 616 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1192 transitions. [2021-11-20 23:13:04,384 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1192 transitions. Word has length 31 [2021-11-20 23:13:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:04,385 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1192 transitions. [2021-11-20 23:13:04,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1192 transitions. [2021-11-20 23:13:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 23:13:04,386 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:04,387 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:04,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:04,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:04,611 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 180552155, now seen corresponding path program 3 times [2021-11-20 23:13:04,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:04,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135110828] [2021-11-20 23:13:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:04,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-20 23:13:04,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:04,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135110828] [2021-11-20 23:13:04,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135110828] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:04,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592819728] [2021-11-20 23:13:04,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:13:04,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:04,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:04,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 23:13:04,815 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:13:04,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:04,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-20 23:13:04,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:04,952 INFO L388 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 [2021-11-20 23:13:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:05,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 23:13:05,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592819728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:13:05,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:13:05,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-20 23:13:05,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707418949] [2021-11-20 23:13:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:05,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:13:05,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:13:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-20 23:13:05,024 INFO L87 Difference]: Start difference. First operand 617 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:05,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:05,178 INFO L93 Difference]: Finished difference Result 1473 states and 2863 transitions. [2021-11-20 23:13:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 23:13:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2021-11-20 23:13:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:05,190 INFO L225 Difference]: With dead ends: 1473 [2021-11-20 23:13:05,190 INFO L226 Difference]: Without dead ends: 1473 [2021-11-20 23:13:05,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-20 23:13:05,191 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 153 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:05,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 140 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:13:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2021-11-20 23:13:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 617. [2021-11-20 23:13:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 610 states have (on average 1.9540983606557376) internal successors, (1192), 616 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1192 transitions. [2021-11-20 23:13:05,225 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1192 transitions. Word has length 31 [2021-11-20 23:13:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:05,226 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1192 transitions. [2021-11-20 23:13:05,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-11-20 23:13:05,226 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1192 transitions. [2021-11-20 23:13:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:13:05,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:05,228 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:05,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:05,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 23:13:05,443 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1618809597, now seen corresponding path program 1 times [2021-11-20 23:13:05,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:05,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962468083] [2021-11-20 23:13:05,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:05,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:05,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:05,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962468083] [2021-11-20 23:13:05,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962468083] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:05,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687122011] [2021-11-20 23:13:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:05,764 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:05,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:05,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:05,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 23:13:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:05,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:13:05,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:06,163 INFO L388 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 11 treesize of output 7 [2021-11-20 23:13:06,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,209 INFO L388 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 21 treesize of output 20 [2021-11-20 23:13:06,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:13:06,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:06,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:13:06,710 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-20 23:13:06,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:13:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:06,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:08,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|) (let ((.cse0 (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2021-11-20 23:13:33,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_60| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3))))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_60|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_60|))) is different from false [2021-11-20 23:13:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:13:39,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687122011] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:13:39,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296081433] [2021-11-20 23:13:39,461 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:13:39,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:13:39,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-20 23:13:39,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394871652] [2021-11-20 23:13:39,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:13:39,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:13:39,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:13:39,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=642, Unknown=13, NotChecked=110, Total=930 [2021-11-20 23:13:39,467 INFO L87 Difference]: Start difference. First operand 617 states and 1192 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:40,832 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|) (let ((.cse1 (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:13:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:41,638 INFO L93 Difference]: Finished difference Result 1644 states and 3238 transitions. [2021-11-20 23:13:41,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:13:41,639 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:13:41,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:41,651 INFO L225 Difference]: With dead ends: 1644 [2021-11-20 23:13:41,651 INFO L226 Difference]: Without dead ends: 1644 [2021-11-20 23:13:41,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=308, Invalid=1096, Unknown=14, NotChecked=222, Total=1640 [2021-11-20 23:13:41,653 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 274 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 529 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:41,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 239 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1070 Invalid, 0 Unknown, 529 Unchecked, 1.0s Time] [2021-11-20 23:13:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2021-11-20 23:13:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 621. [2021-11-20 23:13:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 614 states have (on average 1.9543973941368078) internal successors, (1200), 620 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1200 transitions. [2021-11-20 23:13:41,684 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1200 transitions. Word has length 45 [2021-11-20 23:13:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:41,684 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 1200 transitions. [2021-11-20 23:13:41,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1200 transitions. [2021-11-20 23:13:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:13:41,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:41,705 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:41,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:41,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 23:13:41,919 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1234870293, now seen corresponding path program 2 times [2021-11-20 23:13:41,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:41,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041231303] [2021-11-20 23:13:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:41,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:42,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041231303] [2021-11-20 23:13:42,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041231303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:42,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960461237] [2021-11-20 23:13:42,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:13:42,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:42,302 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:42,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 23:13:42,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:13:42,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:42,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:13:42,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:42,481 INFO L388 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 [2021-11-20 23:13:42,629 INFO L388 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 11 treesize of output 7 [2021-11-20 23:13:42,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,691 INFO L388 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 21 treesize of output 20 [2021-11-20 23:13:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:13:42,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:42,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:13:43,039 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:13:43,039 INFO L388 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 19 treesize of output 11 [2021-11-20 23:13:43,200 INFO L354 Elim1Store]: treesize reduction 196, result has 15.2 percent of original size [2021-11-20 23:13:43,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:13:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:13:43,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:43,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:43,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:13:44,318 INFO L388 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 50 treesize of output 48 [2021-11-20 23:13:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:13:44,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960461237] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:44,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:13:44,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-20 23:13:44,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341298318] [2021-11-20 23:13:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:13:44,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:13:44,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:13:44,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:13:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:13:44,358 INFO L87 Difference]: Start difference. First operand 621 states and 1200 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:13:49,065 INFO L93 Difference]: Finished difference Result 1061 states and 2077 transitions. [2021-11-20 23:13:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-20 23:13:49,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:13:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:13:49,073 INFO L225 Difference]: With dead ends: 1061 [2021-11-20 23:13:49,073 INFO L226 Difference]: Without dead ends: 1061 [2021-11-20 23:13:49,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:13:49,074 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:13:49,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 25 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-20 23:13:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-11-20 23:13:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 622. [2021-11-20 23:13:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 615 states have (on average 1.9544715447154473) internal successors, (1202), 621 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1202 transitions. [2021-11-20 23:13:49,124 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1202 transitions. Word has length 45 [2021-11-20 23:13:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:13:49,125 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 1202 transitions. [2021-11-20 23:13:49,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:13:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1202 transitions. [2021-11-20 23:13:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:13:49,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:13:49,127 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:13:49,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 23:13:49,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 23:13:49,356 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:13:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:13:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1337988693, now seen corresponding path program 3 times [2021-11-20 23:13:49,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:13:49,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122043521] [2021-11-20 23:13:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:13:49,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:13:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:13:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:49,695 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:13:49,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122043521] [2021-11-20 23:13:49,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122043521] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:13:49,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224698701] [2021-11-20 23:13:49,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:13:49,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:13:49,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:13:49,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:13:49,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 23:13:50,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:13:50,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:13:50,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:13:50,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:13:50,371 INFO L388 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 11 treesize of output 7 [2021-11-20 23:13:50,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:50,426 INFO L388 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 21 treesize of output 20 [2021-11-20 23:13:50,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:50,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:50,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:13:50,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:13:50,795 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-20 23:13:50,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:13:50,938 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:13:50,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:13:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:13:51,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:13:53,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) is different from false [2021-11-20 23:14:09,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1))))))) is different from false [2021-11-20 23:14:17,593 INFO L354 Elim1Store]: treesize reduction 154, result has 31.6 percent of original size [2021-11-20 23:14:17,594 INFO L388 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 4 case distinctions, treesize of input 184 treesize of output 122 [2021-11-20 23:14:17,605 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:14:17,605 INFO L388 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 122 treesize of output 112 [2021-11-20 23:14:17,650 INFO L354 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2021-11-20 23:14:17,651 INFO L388 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 140 treesize of output 146 [2021-11-20 23:14:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:14:22,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224698701] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:14:22,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543032774] [2021-11-20 23:14:22,058 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:14:22,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:14:22,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-20 23:14:22,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120174708] [2021-11-20 23:14:22,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:14:22,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:14:22,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:22,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:14:22,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=610, Unknown=13, NotChecked=106, Total=870 [2021-11-20 23:14:22,061 INFO L87 Difference]: Start difference. First operand 622 states and 1202 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:23,396 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (store (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2))))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:14:24,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (let ((.cse1 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:14:25,344 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (let ((.cse1 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:14:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:26,314 INFO L93 Difference]: Finished difference Result 1788 states and 3524 transitions. [2021-11-20 23:14:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 23:14:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2021-11-20 23:14:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:26,326 INFO L225 Difference]: With dead ends: 1788 [2021-11-20 23:14:26,326 INFO L226 Difference]: Without dead ends: 1788 [2021-11-20 23:14:26,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=314, Invalid=1330, Unknown=16, NotChecked=410, Total=2070 [2021-11-20 23:14:26,328 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 425 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:26,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 226 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1358 Invalid, 0 Unknown, 891 Unchecked, 1.2s Time] [2021-11-20 23:14:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2021-11-20 23:14:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 625. [2021-11-20 23:14:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 618 states have (on average 1.9546925566343043) internal successors, (1208), 624 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1208 transitions. [2021-11-20 23:14:26,360 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1208 transitions. Word has length 45 [2021-11-20 23:14:26,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:26,360 INFO L470 AbstractCegarLoop]: Abstraction has 625 states and 1208 transitions. [2021-11-20 23:14:26,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:14:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1208 transitions. [2021-11-20 23:14:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:14:26,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:26,362 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:26,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-11-20 23:14:26,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-20 23:14:26,575 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:14:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2078878673, now seen corresponding path program 4 times [2021-11-20 23:14:26,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:26,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144541416] [2021-11-20 23:14:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:26,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:14:26,994 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:26,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144541416] [2021-11-20 23:14:26,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144541416] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:26,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039913958] [2021-11-20 23:14:26,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:14:26,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:26,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:26,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 23:14:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:27,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:14:27,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:27,310 INFO L388 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 11 treesize of output 7 [2021-11-20 23:14:27,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,364 INFO L388 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 21 treesize of output 20 [2021-11-20 23:14:27,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:14:27,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:27,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:14:27,832 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-20 23:14:27,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:14:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:14:27,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:14:31,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1))))))) is different from false [2021-11-20 23:14:56,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_63|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_63|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|))) is different from false [2021-11-20 23:15:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2021-11-20 23:15:01,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039913958] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:01,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255709169] [2021-11-20 23:15:01,163 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:01,164 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:01,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-20 23:15:01,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977856940] [2021-11-20 23:15:01,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:01,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:15:01,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:15:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=649, Unknown=16, NotChecked=110, Total=930 [2021-11-20 23:15:01,166 INFO L87 Difference]: Start difference. First operand 625 states and 1208 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:02,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_63|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= (select .cse0 .cse3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_63|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-20 23:15:03,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (store .cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 .cse3)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|) (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse2 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3)) (= |c_~#cache~0.base| 1)))) is different from false [2021-11-20 23:15:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:04,434 INFO L93 Difference]: Finished difference Result 1618 states and 3186 transitions. [2021-11-20 23:15:04,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:15:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:04,446 INFO L225 Difference]: With dead ends: 1618 [2021-11-20 23:15:04,446 INFO L226 Difference]: Without dead ends: 1618 [2021-11-20 23:15:04,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=301, Invalid=1029, Unknown=18, NotChecked=292, Total=1640 [2021-11-20 23:15:04,448 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 414 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 921 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:04,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [414 Valid, 185 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1042 Invalid, 0 Unknown, 921 Unchecked, 0.9s Time] [2021-11-20 23:15:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2021-11-20 23:15:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 627. [2021-11-20 23:15:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 620 states have (on average 1.9548387096774194) internal successors, (1212), 626 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1212 transitions. [2021-11-20 23:15:04,479 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1212 transitions. Word has length 45 [2021-11-20 23:15:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:04,479 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 1212 transitions. [2021-11-20 23:15:04,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1212 transitions. [2021-11-20 23:15:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:15:04,481 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:04,481 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:04,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:04,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 23:15:04,696 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:15:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2112970223, now seen corresponding path program 5 times [2021-11-20 23:15:04,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:04,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266122690] [2021-11-20 23:15:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:04,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:05,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:05,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266122690] [2021-11-20 23:15:05,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266122690] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559789637] [2021-11-20 23:15:05,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:05,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:05,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:05,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:05,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 23:15:05,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:15:05,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:05,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:15:05,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:05,304 INFO L388 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 [2021-11-20 23:15:05,429 INFO L388 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 11 treesize of output 7 [2021-11-20 23:15:05,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:05,504 INFO L388 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 21 treesize of output 20 [2021-11-20 23:15:05,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:05,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:05,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:05,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:15:05,743 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:15:05,743 INFO L388 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 19 treesize of output 11 [2021-11-20 23:15:05,907 INFO L354 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2021-11-20 23:15:05,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:15:06,053 INFO L354 Elim1Store]: treesize reduction 188, result has 17.2 percent of original size [2021-11-20 23:15:06,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:15:06,118 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:15:06,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:06,748 INFO L354 Elim1Store]: treesize reduction 186, result has 17.3 percent of original size [2021-11-20 23:15:06,748 INFO L388 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 4 case distinctions, treesize of input 58 treesize of output 53 [2021-11-20 23:15:06,753 INFO L388 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 61 treesize of output 49 [2021-11-20 23:15:06,768 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:15:06,768 INFO L388 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 56 treesize of output 38 [2021-11-20 23:15:06,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,830 INFO L354 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2021-11-20 23:15:06,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 49 [2021-11-20 23:15:06,839 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:15:06,839 INFO L388 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 57 treesize of output 49 [2021-11-20 23:15:06,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,874 INFO L354 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2021-11-20 23:15:06,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 24 [2021-11-20 23:15:06,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,940 INFO L354 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2021-11-20 23:15:06,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 51 [2021-11-20 23:15:06,951 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:15:06,952 INFO L388 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 59 treesize of output 51 [2021-11-20 23:15:06,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:06,975 INFO L354 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2021-11-20 23:15:06,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 26 [2021-11-20 23:15:07,240 INFO L388 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 42 treesize of output 40 [2021-11-20 23:15:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:15:07,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559789637] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:07,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:15:07,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2021-11-20 23:15:07,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925206563] [2021-11-20 23:15:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:07,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:15:07,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:07,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:15:07,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-11-20 23:15:07,276 INFO L87 Difference]: Start difference. First operand 627 states and 1212 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:12,299 INFO L93 Difference]: Finished difference Result 1083 states and 2119 transitions. [2021-11-20 23:15:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:15:12,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:15:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:12,319 INFO L225 Difference]: With dead ends: 1083 [2021-11-20 23:15:12,319 INFO L226 Difference]: Without dead ends: 1083 [2021-11-20 23:15:12,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:15:12,320 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 70 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:12,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 25 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-11-20 23:15:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-11-20 23:15:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 629. [2021-11-20 23:15:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 622 states have (on average 1.954983922829582) internal successors, (1216), 628 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1216 transitions. [2021-11-20 23:15:12,364 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1216 transitions. Word has length 45 [2021-11-20 23:15:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:12,364 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 1216 transitions. [2021-11-20 23:15:12,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1216 transitions. [2021-11-20 23:15:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:15:12,366 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:12,366 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:12,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:12,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:12,583 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:15:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2112992543, now seen corresponding path program 6 times [2021-11-20 23:15:12,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:12,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933489610] [2021-11-20 23:15:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:12,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:13,014 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933489610] [2021-11-20 23:15:13,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933489610] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819230130] [2021-11-20 23:15:13,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:15:13,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:13,015 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:13,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 23:15:13,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:15:13,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 23:15:13,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:13,737 INFO L388 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 11 treesize of output 7 [2021-11-20 23:15:13,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:13,817 INFO L388 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 21 treesize of output 20 [2021-11-20 23:15:13,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:13,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:13,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:13,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:15:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:15:14,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:14,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:15:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:14,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:15,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:15,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819230130] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366437248] [2021-11-20 23:15:15,459 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:15,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:15,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-20 23:15:15,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724165427] [2021-11-20 23:15:15,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:15,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:15:15,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:15,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:15:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:15:15,461 INFO L87 Difference]: Start difference. First operand 629 states and 1216 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:17,975 INFO L93 Difference]: Finished difference Result 1173 states and 2299 transitions. [2021-11-20 23:15:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:17,976 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:15:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:17,983 INFO L225 Difference]: With dead ends: 1173 [2021-11-20 23:15:17,983 INFO L226 Difference]: Without dead ends: 1171 [2021-11-20 23:15:17,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=460, Invalid=1432, Unknown=0, NotChecked=0, Total=1892 [2021-11-20 23:15:17,984 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 324 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:17,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 172 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-20 23:15:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2021-11-20 23:15:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 661. [2021-11-20 23:15:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 654 states have (on average 1.9587155963302751) internal successors, (1281), 660 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1281 transitions. [2021-11-20 23:15:18,021 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1281 transitions. Word has length 45 [2021-11-20 23:15:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:18,022 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 1281 transitions. [2021-11-20 23:15:18,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1281 transitions. [2021-11-20 23:15:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:15:18,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:18,024 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:18,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:18,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 23:15:18,248 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:15:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:18,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1742148547, now seen corresponding path program 7 times [2021-11-20 23:15:18,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:18,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493898971] [2021-11-20 23:15:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:18,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:18,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493898971] [2021-11-20 23:15:18,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493898971] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632594378] [2021-11-20 23:15:18,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:15:18,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:18,544 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:18,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 23:15:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:18,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:15:18,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:18,986 INFO L388 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 11 treesize of output 7 [2021-11-20 23:15:19,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:19,054 INFO L388 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 21 treesize of output 20 [2021-11-20 23:15:19,323 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-20 23:15:19,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-11-20 23:15:19,479 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-20 23:15:19,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:15:19,600 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:15:19,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:15:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:19,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:21,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2021-11-20 23:15:23,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|))) is different from false [2021-11-20 23:15:25,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))))) is different from false [2021-11-20 23:15:25,852 INFO L354 Elim1Store]: treesize reduction 43, result has 61.6 percent of original size [2021-11-20 23:15:25,853 INFO L388 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 3 case distinctions, treesize of input 106 treesize of output 106 [2021-11-20 23:15:25,856 INFO L388 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 106 treesize of output 94 [2021-11-20 23:15:25,862 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 23:15:25,863 INFO L388 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 114 treesize of output 96 [2021-11-20 23:15:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:15:26,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632594378] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:15:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549007181] [2021-11-20 23:15:26,140 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:15:26,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:15:26,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-20 23:15:26,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346372996] [2021-11-20 23:15:26,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:26,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:15:26,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:15:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=542, Unknown=3, NotChecked=150, Total=812 [2021-11-20 23:15:26,145 INFO L87 Difference]: Start difference. First operand 661 states and 1281 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:27,374 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-20 23:15:29,386 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|))) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:15:30,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:15:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:30,662 INFO L93 Difference]: Finished difference Result 1592 states and 3137 transitions. [2021-11-20 23:15:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:15:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2021-11-20 23:15:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:30,672 INFO L225 Difference]: With dead ends: 1592 [2021-11-20 23:15:30,672 INFO L226 Difference]: Without dead ends: 1592 [2021-11-20 23:15:30,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=188, Invalid=886, Unknown=6, NotChecked=402, Total=1482 [2021-11-20 23:15:30,674 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 216 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:30,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 215 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 649 Invalid, 0 Unknown, 489 Unchecked, 0.5s Time] [2021-11-20 23:15:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2021-11-20 23:15:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 664. [2021-11-20 23:15:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 1.9589041095890412) internal successors, (1287), 663 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1287 transitions. [2021-11-20 23:15:30,704 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1287 transitions. Word has length 45 [2021-11-20 23:15:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:30,705 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 1287 transitions. [2021-11-20 23:15:30,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1287 transitions. [2021-11-20 23:15:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:15:30,706 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:30,707 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:30,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:30,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 23:15:30,931 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:15:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash -332227623, now seen corresponding path program 8 times [2021-11-20 23:15:30,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:30,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609412540] [2021-11-20 23:15:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:30,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:31,317 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609412540] [2021-11-20 23:15:31,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609412540] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632511170] [2021-11-20 23:15:31,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:15:31,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:31,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:31,319 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:31,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 23:15:31,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:15:31,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:31,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:15:31,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:31,472 INFO L388 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 [2021-11-20 23:15:31,611 INFO L388 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 11 treesize of output 7 [2021-11-20 23:15:31,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,721 INFO L388 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 21 treesize of output 20 [2021-11-20 23:15:31,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:15:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:15:32,001 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:15:32,002 INFO L388 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 19 treesize of output 11 [2021-11-20 23:15:32,157 INFO L354 Elim1Store]: treesize reduction 196, result has 15.2 percent of original size [2021-11-20 23:15:32,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:15:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:15:32,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:32,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:32,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:15:33,279 INFO L388 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 50 treesize of output 48 [2021-11-20 23:15:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:15:33,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632511170] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:33,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:15:33,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-20 23:15:33,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005261425] [2021-11-20 23:15:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:33,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:15:33,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:15:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:15:33,329 INFO L87 Difference]: Start difference. First operand 664 states and 1287 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:39,488 INFO L93 Difference]: Finished difference Result 1142 states and 2235 transitions. [2021-11-20 23:15:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:15:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:15:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:39,496 INFO L225 Difference]: With dead ends: 1142 [2021-11-20 23:15:39,496 INFO L226 Difference]: Without dead ends: 1142 [2021-11-20 23:15:39,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=314, Invalid=1168, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:15:39,498 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:39,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 25 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-20 23:15:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2021-11-20 23:15:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 667. [2021-11-20 23:15:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 660 states have (on average 1.959090909090909) internal successors, (1293), 666 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1293 transitions. [2021-11-20 23:15:39,521 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1293 transitions. Word has length 45 [2021-11-20 23:15:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:39,522 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 1293 transitions. [2021-11-20 23:15:39,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:15:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1293 transitions. [2021-11-20 23:15:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:15:39,523 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:39,524 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:39,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:39,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:39,748 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:15:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -229109223, now seen corresponding path program 9 times [2021-11-20 23:15:39,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:15:39,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17384583] [2021-11-20 23:15:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:39,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:15:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:40,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:15:40,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17384583] [2021-11-20 23:15:40,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17384583] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:15:40,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74685977] [2021-11-20 23:15:40,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:15:40,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:40,058 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:15:40,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 23:15:40,511 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:15:40,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:15:40,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:15:40,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:40,792 INFO L388 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 11 treesize of output 7 [2021-11-20 23:15:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:40,887 INFO L388 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 21 treesize of output 20 [2021-11-20 23:15:40,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:40,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:40,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:40,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:15:41,192 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-20 23:15:41,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:15:41,378 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:15:41,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:15:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:15:41,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:43,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) is different from false [2021-11-20 23:15:58,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))))) is different from false [2021-11-20 23:16:21,533 WARN L227 SmtUtils]: Spent 10.27s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:16:21,646 INFO L354 Elim1Store]: treesize reduction 242, result has 15.1 percent of original size [2021-11-20 23:16:21,646 INFO L388 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 4 case distinctions, treesize of input 74 treesize of output 66 [2021-11-20 23:16:21,652 INFO L388 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 80 treesize of output 68 [2021-11-20 23:16:21,660 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-20 23:16:21,661 INFO L388 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 71 treesize of output 55 [2021-11-20 23:16:21,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,692 INFO L354 Elim1Store]: treesize reduction 165, result has 0.6 percent of original size [2021-11-20 23:16:21,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 1 [2021-11-20 23:16:21,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:16:21,714 INFO L354 Elim1Store]: treesize reduction 165, result has 0.6 percent of original size [2021-11-20 23:16:21,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 1 [2021-11-20 23:16:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:16:24,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74685977] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:16:24,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797121074] [2021-11-20 23:16:24,812 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:16:24,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:16:24,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-20 23:16:24,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875867330] [2021-11-20 23:16:24,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:16:24,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:16:24,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:16:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:16:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=615, Unknown=16, NotChecked=106, Total=870 [2021-11-20 23:16:24,816 INFO L87 Difference]: Start difference. First operand 667 states and 1293 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:28,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (store .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse1 (store (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:16:29,278 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|) (let ((.cse0 (store (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))))) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:16:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:16:30,015 INFO L93 Difference]: Finished difference Result 1877 states and 3675 transitions. [2021-11-20 23:16:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:16:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2021-11-20 23:16:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:16:30,026 INFO L225 Difference]: With dead ends: 1877 [2021-11-20 23:16:30,026 INFO L226 Difference]: Without dead ends: 1877 [2021-11-20 23:16:30,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=248, Invalid=1231, Unknown=19, NotChecked=308, Total=1806 [2021-11-20 23:16:30,028 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 457 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:16:30,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 191 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1011 Invalid, 0 Unknown, 663 Unchecked, 0.9s Time] [2021-11-20 23:16:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2021-11-20 23:16:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 666. [2021-11-20 23:16:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 659 states have (on average 1.9590288315629742) internal successors, (1291), 665 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1291 transitions. [2021-11-20 23:16:30,076 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1291 transitions. Word has length 45 [2021-11-20 23:16:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:16:30,076 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 1291 transitions. [2021-11-20 23:16:30,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:16:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1291 transitions. [2021-11-20 23:16:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:16:30,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:16:30,078 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:16:30,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 23:16:30,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:30,297 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:16:30,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:16:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash -668957749, now seen corresponding path program 10 times [2021-11-20 23:16:30,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:16:30,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899329753] [2021-11-20 23:16:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:16:30,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:16:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:16:30,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:16:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899329753] [2021-11-20 23:16:30,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899329753] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:16:30,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838417712] [2021-11-20 23:16:30,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:16:30,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:16:30,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:16:30,568 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:16:30,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 23:16:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:16:30,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:16:30,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:16:30,914 INFO L388 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 11 treesize of output 7 [2021-11-20 23:16:31,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:16:31,024 INFO L388 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 21 treesize of output 20 [2021-11-20 23:16:31,186 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-20 23:16:31,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-11-20 23:16:31,322 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-20 23:16:31,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:16:31,485 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:16:31,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:16:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:16:31,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:08,689 WARN L227 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 23:17:08,761 INFO L354 Elim1Store]: treesize reduction 112, result has 24.3 percent of original size [2021-11-20 23:17:08,761 INFO L388 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 3 case distinctions, treesize of input 66 treesize of output 61 [2021-11-20 23:17:08,770 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:08,771 INFO L388 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 65 treesize of output 61 [2021-11-20 23:17:08,776 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 23:17:08,777 INFO L388 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 66 treesize of output 56 [2021-11-20 23:17:08,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:08,827 INFO L354 Elim1Store]: treesize reduction 80, result has 29.2 percent of original size [2021-11-20 23:17:08,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 56 [2021-11-20 23:17:08,841 INFO L388 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 64 treesize of output 56 [2021-11-20 23:17:08,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:08,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:08,850 INFO L388 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 47 treesize of output 39 [2021-11-20 23:17:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:15,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838417712] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [626051147] [2021-11-20 23:17:15,069 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:15,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:15,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-20 23:17:15,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530308309] [2021-11-20 23:17:15,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:15,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:17:15,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:17:15,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=669, Unknown=17, NotChecked=0, Total=812 [2021-11-20 23:17:15,074 INFO L87 Difference]: Start difference. First operand 666 states and 1291 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:17,186 INFO L93 Difference]: Finished difference Result 1192 states and 2338 transitions. [2021-11-20 23:17:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:17:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2021-11-20 23:17:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:17,190 INFO L225 Difference]: With dead ends: 1192 [2021-11-20 23:17:17,190 INFO L226 Difference]: Without dead ends: 1192 [2021-11-20 23:17:17,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 44.3s TimeCoverageRelationStatistics Valid=609, Invalid=1726, Unknown=17, NotChecked=0, Total=2352 [2021-11-20 23:17:17,192 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 386 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:17,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 120 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1416 Invalid, 0 Unknown, 559 Unchecked, 1.2s Time] [2021-11-20 23:17:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-11-20 23:17:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 666. [2021-11-20 23:17:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 659 states have (on average 1.9590288315629742) internal successors, (1291), 665 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1291 transitions. [2021-11-20 23:17:17,216 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1291 transitions. Word has length 45 [2021-11-20 23:17:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:17,216 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 1291 transitions. [2021-11-20 23:17:17,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1291 transitions. [2021-11-20 23:17:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:17:17,218 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:17,218 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:17,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:17,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-20 23:17:17,432 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:17:17,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2064413461, now seen corresponding path program 11 times [2021-11-20 23:17:17,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:17,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966913250] [2021-11-20 23:17:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:17,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:17,693 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966913250] [2021-11-20 23:17:17,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966913250] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:17,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108360277] [2021-11-20 23:17:17,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:17,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:17,695 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:17,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 23:17:17,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:17:17,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:17,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-20 23:17:17,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:17,869 INFO L388 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 [2021-11-20 23:17:17,954 INFO L388 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 11 treesize of output 7 [2021-11-20 23:17:18,012 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:17:18,013 INFO L388 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 19 treesize of output 11 [2021-11-20 23:17:18,066 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-20 23:17:18,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 23 treesize of output 22 [2021-11-20 23:17:18,132 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-11-20 23:17:18,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-20 23:17:18,189 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-20 23:17:18,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:17:18,282 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-20 23:17:18,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:17:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:17:18,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:18,492 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-20 23:17:18,492 INFO L388 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 47 treesize of output 39 [2021-11-20 23:17:18,495 INFO L388 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 35 treesize of output 31 [2021-11-20 23:17:18,499 INFO L388 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 38 treesize of output 34 [2021-11-20 23:17:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:17:18,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108360277] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:18,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:17:18,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 22 [2021-11-20 23:17:18,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186426703] [2021-11-20 23:17:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:18,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 23:17:18,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 23:17:18,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2021-11-20 23:17:18,614 INFO L87 Difference]: Start difference. First operand 666 states and 1291 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:19,587 INFO L93 Difference]: Finished difference Result 1094 states and 2146 transitions. [2021-11-20 23:17:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-20 23:17:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:17:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:19,591 INFO L225 Difference]: With dead ends: 1094 [2021-11-20 23:17:19,591 INFO L226 Difference]: Without dead ends: 1094 [2021-11-20 23:17:19,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:17:19,592 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:19,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 28 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 493 Invalid, 0 Unknown, 184 Unchecked, 0.5s Time] [2021-11-20 23:17:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-11-20 23:17:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 678. [2021-11-20 23:17:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 671 states have (on average 1.9597615499254843) internal successors, (1315), 677 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1315 transitions. [2021-11-20 23:17:19,617 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1315 transitions. Word has length 45 [2021-11-20 23:17:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:19,617 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1315 transitions. [2021-11-20 23:17:19,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1315 transitions. [2021-11-20 23:17:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:17:19,619 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:19,620 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:19,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:19,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 23:17:19,828 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:17:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1966996891, now seen corresponding path program 12 times [2021-11-20 23:17:19,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:19,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697098408] [2021-11-20 23:17:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:19,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:20,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697098408] [2021-11-20 23:17:20,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697098408] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:20,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046481598] [2021-11-20 23:17:20,144 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:20,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:20,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:20,148 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:20,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 23:17:20,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:20,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:20,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-20 23:17:20,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:20,898 INFO L388 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 11 treesize of output 7 [2021-11-20 23:17:21,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,067 INFO L388 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 21 treesize of output 20 [2021-11-20 23:17:21,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-20 23:17:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:17:21,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:21,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:17:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:21,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:21,661 INFO L354 Elim1Store]: treesize reduction 85, result has 24.1 percent of original size [2021-11-20 23:17:21,662 INFO L388 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 3 case distinctions, treesize of input 46 treesize of output 39 [2021-11-20 23:17:21,664 INFO L388 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 41 treesize of output 33 [2021-11-20 23:17:21,668 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 23:17:21,669 INFO L388 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 36 treesize of output 28 [2021-11-20 23:17:21,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:21,706 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-20 23:17:21,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2021-11-20 23:17:21,716 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:21,717 INFO L388 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 41 treesize of output 37 [2021-11-20 23:17:21,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:21,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:21,729 INFO L354 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2021-11-20 23:17:21,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 22 [2021-11-20 23:17:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:21,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046481598] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:21,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088956868] [2021-11-20 23:17:21,992 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:21,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:21,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-20 23:17:21,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582244863] [2021-11-20 23:17:21,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:21,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:17:21,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:17:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-11-20 23:17:21,995 INFO L87 Difference]: Start difference. First operand 678 states and 1315 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:25,839 INFO L93 Difference]: Finished difference Result 1312 states and 2577 transitions. [2021-11-20 23:17:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-20 23:17:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2021-11-20 23:17:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:25,844 INFO L225 Difference]: With dead ends: 1312 [2021-11-20 23:17:25,844 INFO L226 Difference]: Without dead ends: 1308 [2021-11-20 23:17:25,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=719, Invalid=2037, Unknown=0, NotChecked=0, Total=2756 [2021-11-20 23:17:25,846 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 317 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:25,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 184 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-20 23:17:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-11-20 23:17:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 702. [2021-11-20 23:17:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 695 states have (on average 1.9640287769784173) internal successors, (1365), 701 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1365 transitions. [2021-11-20 23:17:25,869 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1365 transitions. Word has length 45 [2021-11-20 23:17:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:25,870 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1365 transitions. [2021-11-20 23:17:25,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1365 transitions. [2021-11-20 23:17:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:17:25,871 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:25,872 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:25,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:26,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:26,092 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:17:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash 309051415, now seen corresponding path program 13 times [2021-11-20 23:17:26,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:26,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594451657] [2021-11-20 23:17:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:26,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:26,434 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594451657] [2021-11-20 23:17:26,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594451657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:26,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377070138] [2021-11-20 23:17:26,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:17:26,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:26,435 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:26,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 23:17:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:26,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:17:26,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:26,819 INFO L388 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 11 treesize of output 7 [2021-11-20 23:17:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,871 INFO L388 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 21 treesize of output 20 [2021-11-20 23:17:26,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:26,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:17:27,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:27,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:17:27,242 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-20 23:17:27,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:17:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:27,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:29,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342|) (let ((.cse0 (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))) is different from false [2021-11-20 23:17:31,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1))))))) is different from false [2021-11-20 23:17:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:17:49,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377070138] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:17:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1918307108] [2021-11-20 23:17:49,953 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:17:49,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:17:49,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-20 23:17:49,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029678239] [2021-11-20 23:17:49,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:17:49,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:17:49,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:49,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:17:49,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=658, Unknown=8, NotChecked=110, Total=930 [2021-11-20 23:17:49,955 INFO L87 Difference]: Start difference. First operand 702 states and 1365 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:51,663 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (store .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342|) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2))))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse4)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 .cse6)) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 .cse4)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse6)) (= |c_~#cache~0.base| 1)))) is different from false [2021-11-20 23:17:52,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342|) (let ((.cse0 (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_342| 0)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))))))) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:17:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:53,116 INFO L93 Difference]: Finished difference Result 2215 states and 4378 transitions. [2021-11-20 23:17:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-20 23:17:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:17:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:53,124 INFO L225 Difference]: With dead ends: 2215 [2021-11-20 23:17:53,124 INFO L226 Difference]: Without dead ends: 2215 [2021-11-20 23:17:53,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=235, Invalid=961, Unknown=10, NotChecked=276, Total=1482 [2021-11-20 23:17:53,126 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 290 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 754 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:53,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 325 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1183 Invalid, 0 Unknown, 754 Unchecked, 0.9s Time] [2021-11-20 23:17:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2021-11-20 23:17:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 720. [2021-11-20 23:17:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 713 states have (on average 1.964936886395512) internal successors, (1401), 719 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1401 transitions. [2021-11-20 23:17:53,161 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1401 transitions. Word has length 45 [2021-11-20 23:17:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:53,162 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1401 transitions. [2021-11-20 23:17:53,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1401 transitions. [2021-11-20 23:17:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:17:53,164 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:53,164 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:53,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:53,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:53,392 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:17:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash 412169815, now seen corresponding path program 14 times [2021-11-20 23:17:53,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:53,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005326747] [2021-11-20 23:17:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:53,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:53,753 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:53,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005326747] [2021-11-20 23:17:53,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005326747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:53,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750011200] [2021-11-20 23:17:53,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:17:53,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:53,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:53,755 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:53,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 23:17:53,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:17:53,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:53,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:17:53,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:17:53,957 INFO L388 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 [2021-11-20 23:17:54,185 INFO L388 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 11 treesize of output 7 [2021-11-20 23:17:54,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:54,260 INFO L388 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 21 treesize of output 20 [2021-11-20 23:17:54,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:54,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:54,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:17:54,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:17:54,435 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:17:54,435 INFO L388 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 19 treesize of output 11 [2021-11-20 23:17:54,572 INFO L354 Elim1Store]: treesize reduction 128, result has 16.9 percent of original size [2021-11-20 23:17:54,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:17:54,702 INFO L354 Elim1Store]: treesize reduction 188, result has 17.2 percent of original size [2021-11-20 23:17:54,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:17:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:17:54,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:17:55,307 INFO L354 Elim1Store]: treesize reduction 220, result has 17.0 percent of original size [2021-11-20 23:17:55,308 INFO L388 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 4 case distinctions, treesize of input 62 treesize of output 59 [2021-11-20 23:17:55,320 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:55,320 INFO L388 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 67 treesize of output 59 [2021-11-20 23:17:55,344 INFO L354 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2021-11-20 23:17:55,345 INFO L388 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 62 treesize of output 46 [2021-11-20 23:17:55,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,417 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-20 23:17:55,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 57 [2021-11-20 23:17:55,428 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:55,429 INFO L388 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 65 treesize of output 57 [2021-11-20 23:17:55,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,448 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-20 23:17:55,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2021-11-20 23:17:55,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,514 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-20 23:17:55,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 59 [2021-11-20 23:17:55,525 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:17:55,525 INFO L388 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 63 treesize of output 55 [2021-11-20 23:17:55,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:17:55,543 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-20 23:17:55,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2021-11-20 23:17:55,881 INFO L388 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 42 treesize of output 40 [2021-11-20 23:17:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:17:55,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750011200] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:55,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:17:55,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 26 [2021-11-20 23:17:55,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145939331] [2021-11-20 23:17:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:17:55,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:17:55,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:17:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:17:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-11-20 23:17:55,927 INFO L87 Difference]: Start difference. First operand 720 states and 1401 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:17:58,720 INFO L93 Difference]: Finished difference Result 1192 states and 2338 transitions. [2021-11-20 23:17:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 23:17:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:17:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:17:58,723 INFO L225 Difference]: With dead ends: 1192 [2021-11-20 23:17:58,723 INFO L226 Difference]: Without dead ends: 1192 [2021-11-20 23:17:58,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:17:58,724 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 150 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:17:58,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 37 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-20 23:17:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-11-20 23:17:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 725. [2021-11-20 23:17:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 718 states have (on average 1.9651810584958218) internal successors, (1411), 724 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1411 transitions. [2021-11-20 23:17:58,747 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1411 transitions. Word has length 45 [2021-11-20 23:17:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:17:58,748 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1411 transitions. [2021-11-20 23:17:58,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:17:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1411 transitions. [2021-11-20 23:17:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:17:58,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:17:58,750 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:17:58,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-20 23:17:58,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-20 23:17:58,972 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:17:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:17:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 412147495, now seen corresponding path program 15 times [2021-11-20 23:17:58,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:17:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809471128] [2021-11-20 23:17:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:17:58,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:17:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:17:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:17:59,380 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:17:59,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809471128] [2021-11-20 23:17:59,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809471128] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:17:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472501748] [2021-11-20 23:17:59,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:17:59,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:17:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:17:59,384 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:17:59,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 23:17:59,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:17:59,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:17:59,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 23:17:59,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:00,216 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:00,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,284 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:00,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:18:00,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:18:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:00,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:18:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:00,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:01,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:01,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472501748] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404337411] [2021-11-20 23:18:01,607 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:01,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:01,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-20 23:18:01,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813555377] [2021-11-20 23:18:01,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:01,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-20 23:18:01,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-20 23:18:01,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2021-11-20 23:18:01,612 INFO L87 Difference]: Start difference. First operand 725 states and 1411 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:04,935 INFO L93 Difference]: Finished difference Result 1746 states and 3443 transitions. [2021-11-20 23:18:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-20 23:18:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:18:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:04,938 INFO L225 Difference]: With dead ends: 1746 [2021-11-20 23:18:04,939 INFO L226 Difference]: Without dead ends: 1744 [2021-11-20 23:18:04,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2021-11-20 23:18:04,940 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 495 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:04,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 192 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-11-20 23:18:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2021-11-20 23:18:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 735. [2021-11-20 23:18:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 728 states have (on average 1.9656593406593406) internal successors, (1431), 734 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1431 transitions. [2021-11-20 23:18:04,966 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1431 transitions. Word has length 45 [2021-11-20 23:18:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:04,967 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 1431 transitions. [2021-11-20 23:18:04,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1431 transitions. [2021-11-20 23:18:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:04,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:04,969 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:05,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:05,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-20 23:18:05,188 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash -27678711, now seen corresponding path program 16 times [2021-11-20 23:18:05,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:05,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140599322] [2021-11-20 23:18:05,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:05,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:05,465 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:05,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140599322] [2021-11-20 23:18:05,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140599322] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:05,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771212106] [2021-11-20 23:18:05,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:05,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:05,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:05,467 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:05,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 23:18:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:05,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:18:05,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:05,829 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:05,878 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:06,006 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-20 23:18:06,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-11-20 23:18:06,110 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-20 23:18:06,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:18:06,233 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:18:06,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:18:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:06,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:16,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345|) (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse0 (store (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))))) is different from false [2021-11-20 23:18:16,241 INFO L354 Elim1Store]: treesize reduction 43, result has 61.6 percent of original size [2021-11-20 23:18:16,242 INFO L388 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 3 case distinctions, treesize of input 103 treesize of output 103 [2021-11-20 23:18:16,244 INFO L388 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 103 treesize of output 91 [2021-11-20 23:18:16,250 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 23:18:16,251 INFO L388 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 111 treesize of output 93 [2021-11-20 23:18:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:18:18,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771212106] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:18,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961028297] [2021-11-20 23:18:18,318 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:18,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:18,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-20 23:18:18,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411950006] [2021-11-20 23:18:18,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:18,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-20 23:18:18,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:18,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 23:18:18,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=637, Unknown=5, NotChecked=52, Total=812 [2021-11-20 23:18:18,320 INFO L87 Difference]: Start difference. First operand 735 states and 1431 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:19,694 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (store .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345|) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse1 (store (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:18:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:21,437 INFO L93 Difference]: Finished difference Result 2926 states and 5807 transitions. [2021-11-20 23:18:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-20 23:18:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2021-11-20 23:18:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:21,445 INFO L225 Difference]: With dead ends: 2926 [2021-11-20 23:18:21,445 INFO L226 Difference]: Without dead ends: 2926 [2021-11-20 23:18:21,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=571, Invalid=1783, Unknown=6, NotChecked=190, Total=2550 [2021-11-20 23:18:21,447 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 514 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:21,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 325 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1174 Invalid, 0 Unknown, 711 Unchecked, 1.1s Time] [2021-11-20 23:18:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2021-11-20 23:18:21,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 743. [2021-11-20 23:18:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 736 states have (on average 1.966032608695652) internal successors, (1447), 742 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1447 transitions. [2021-11-20 23:18:21,488 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1447 transitions. Word has length 45 [2021-11-20 23:18:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:21,489 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1447 transitions. [2021-11-20 23:18:21,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1447 transitions. [2021-11-20 23:18:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:21,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:21,491 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:21,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:21,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:21,707 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:21,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1686691367, now seen corresponding path program 17 times [2021-11-20 23:18:21,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:21,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401007328] [2021-11-20 23:18:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:21,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:22,015 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:22,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401007328] [2021-11-20 23:18:22,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401007328] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:22,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034683124] [2021-11-20 23:18:22,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:18:22,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:22,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:22,016 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:22,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-20 23:18:22,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:18:22,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:22,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:18:22,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:22,155 INFO L388 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 [2021-11-20 23:18:22,332 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:22,395 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:18:22,396 INFO L388 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 19 treesize of output 11 [2021-11-20 23:18:22,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:22,466 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:22,549 INFO L354 Elim1Store]: treesize reduction 72, result has 19.1 percent of original size [2021-11-20 23:18:22,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-11-20 23:18:22,646 INFO L354 Elim1Store]: treesize reduction 124, result has 19.5 percent of original size [2021-11-20 23:18:22,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:18:22,759 INFO L354 Elim1Store]: treesize reduction 188, result has 17.2 percent of original size [2021-11-20 23:18:22,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:18:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:18:22,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:23,127 INFO L354 Elim1Store]: treesize reduction 101, result has 25.7 percent of original size [2021-11-20 23:18:23,128 INFO L388 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 3 case distinctions, treesize of input 50 treesize of output 47 [2021-11-20 23:18:23,136 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:23,136 INFO L388 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 49 treesize of output 45 [2021-11-20 23:18:23,149 INFO L354 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2021-11-20 23:18:23,149 INFO L388 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 44 treesize of output 36 [2021-11-20 23:18:23,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:23,203 INFO L354 Elim1Store]: treesize reduction 68, result has 34.0 percent of original size [2021-11-20 23:18:23,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 49 [2021-11-20 23:18:23,212 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:23,212 INFO L388 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 49 treesize of output 45 [2021-11-20 23:18:23,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:23,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:18:23,225 INFO L354 Elim1Store]: treesize reduction 23, result has 14.8 percent of original size [2021-11-20 23:18:23,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 34 treesize of output 26 [2021-11-20 23:18:23,425 INFO L388 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 34 treesize of output 32 [2021-11-20 23:18:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:18:23,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034683124] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:23,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:18:23,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2021-11-20 23:18:23,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931221728] [2021-11-20 23:18:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:18:23,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 23:18:23,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 23:18:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2021-11-20 23:18:23,460 INFO L87 Difference]: Start difference. First operand 743 states and 1447 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:25,660 INFO L93 Difference]: Finished difference Result 1197 states and 2348 transitions. [2021-11-20 23:18:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 23:18:25,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:18:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:25,678 INFO L225 Difference]: With dead ends: 1197 [2021-11-20 23:18:25,678 INFO L226 Difference]: Without dead ends: 1197 [2021-11-20 23:18:25,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2021-11-20 23:18:25,679 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 105 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:25,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 37 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-20 23:18:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-11-20 23:18:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 745. [2021-11-20 23:18:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 738 states have (on average 1.9661246612466126) internal successors, (1451), 744 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1451 transitions. [2021-11-20 23:18:25,700 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1451 transitions. Word has length 45 [2021-11-20 23:18:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:25,700 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1451 transitions. [2021-11-20 23:18:25,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1451 transitions. [2021-11-20 23:18:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:25,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:25,703 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:25,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:25,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-20 23:18:25,919 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1688046377, now seen corresponding path program 18 times [2021-11-20 23:18:25,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102650104] [2021-11-20 23:18:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:25,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:26,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102650104] [2021-11-20 23:18:26,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102650104] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601562739] [2021-11-20 23:18:26,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:18:26,200 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:26,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:26,201 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:26,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-20 23:18:26,663 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:18:26,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:18:26,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:18:26,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:26,962 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:27,079 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:27,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:27,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:27,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:27,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:18:27,242 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-20 23:18:27,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:18:27,380 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:18:27,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:18:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:27,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:29,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))) is different from false [2021-11-20 23:18:29,919 INFO L354 Elim1Store]: treesize reduction 154, result has 31.6 percent of original size [2021-11-20 23:18:29,920 INFO L388 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 4 case distinctions, treesize of input 181 treesize of output 119 [2021-11-20 23:18:29,930 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:29,930 INFO L388 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 119 treesize of output 109 [2021-11-20 23:18:29,957 INFO L354 Elim1Store]: treesize reduction 32, result has 47.5 percent of original size [2021-11-20 23:18:29,958 INFO L388 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 137 treesize of output 143 [2021-11-20 23:18:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:30,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601562739] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:30,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126467695] [2021-11-20 23:18:30,344 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:30,344 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:30,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-20 23:18:30,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74624806] [2021-11-20 23:18:30,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:30,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-20 23:18:30,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-20 23:18:30,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=694, Unknown=1, NotChecked=54, Total=870 [2021-11-20 23:18:30,347 INFO L87 Difference]: Start difference. First operand 745 states and 1451 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:32,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse0 (store (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_347|))) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (store .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:18:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:33,415 INFO L93 Difference]: Finished difference Result 2431 states and 4810 transitions. [2021-11-20 23:18:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:18:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2021-11-20 23:18:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:33,425 INFO L225 Difference]: With dead ends: 2431 [2021-11-20 23:18:33,425 INFO L226 Difference]: Without dead ends: 2427 [2021-11-20 23:18:33,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=196, Invalid=1000, Unknown=2, NotChecked=134, Total=1332 [2021-11-20 23:18:33,435 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 348 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:33,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 269 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1608 Invalid, 0 Unknown, 398 Unchecked, 1.8s Time] [2021-11-20 23:18:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-11-20 23:18:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 801. [2021-11-20 23:18:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 794 states have (on average 1.973551637279597) internal successors, (1567), 800 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1567 transitions. [2021-11-20 23:18:33,475 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1567 transitions. Word has length 45 [2021-11-20 23:18:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:33,476 INFO L470 AbstractCegarLoop]: Abstraction has 801 states and 1567 transitions. [2021-11-20 23:18:33,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1567 transitions. [2021-11-20 23:18:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:33,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:33,478 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:33,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:33,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-20 23:18:33,703 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash -81435775, now seen corresponding path program 19 times [2021-11-20 23:18:33,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:33,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140927164] [2021-11-20 23:18:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:33,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:33,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140927164] [2021-11-20 23:18:33,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140927164] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377397498] [2021-11-20 23:18:33,946 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:18:33,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:33,951 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:33,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-20 23:18:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:34,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 23:18:34,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:34,433 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:34,500 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-20 23:18:34,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 35 treesize of output 34 [2021-11-20 23:18:34,593 INFO L354 Elim1Store]: treesize reduction 76, result has 22.4 percent of original size [2021-11-20 23:18:34,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2021-11-20 23:18:34,695 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-20 23:18:34,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2021-11-20 23:18:34,838 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-20 23:18:34,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-20 23:18:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:34,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:35,063 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-20 23:18:35,063 INFO L388 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 36 treesize of output 29 [2021-11-20 23:18:35,070 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:35,070 INFO L388 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 29 treesize of output 29 [2021-11-20 23:18:35,077 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:18:35,077 INFO L388 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 32 treesize of output 32 [2021-11-20 23:18:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:35,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377397498] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:35,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1916732324] [2021-11-20 23:18:35,301 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:35,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:35,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2021-11-20 23:18:35,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217979178] [2021-11-20 23:18:35,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:35,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:18:35,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:18:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:18:35,304 INFO L87 Difference]: Start difference. First operand 801 states and 1567 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:40,152 INFO L93 Difference]: Finished difference Result 2475 states and 4903 transitions. [2021-11-20 23:18:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-20 23:18:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 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 45 [2021-11-20 23:18:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:40,163 INFO L225 Difference]: With dead ends: 2475 [2021-11-20 23:18:40,163 INFO L226 Difference]: Without dead ends: 2471 [2021-11-20 23:18:40,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1120, Invalid=3992, Unknown=0, NotChecked=0, Total=5112 [2021-11-20 23:18:40,166 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 537 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 786 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:40,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 159 Invalid, 4244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3309 Invalid, 0 Unknown, 786 Unchecked, 2.8s Time] [2021-11-20 23:18:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2021-11-20 23:18:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 927. [2021-11-20 23:18:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 920 states have (on average 1.9847826086956522) internal successors, (1826), 926 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1826 transitions. [2021-11-20 23:18:40,220 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1826 transitions. Word has length 45 [2021-11-20 23:18:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:40,221 INFO L470 AbstractCegarLoop]: Abstraction has 927 states and 1826 transitions. [2021-11-20 23:18:40,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1826 transitions. [2021-11-20 23:18:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:40,223 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:40,224 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:18:40,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:40,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:40,451 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash 751274168, now seen corresponding path program 1 times [2021-11-20 23:18:40,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727333425] [2021-11-20 23:18:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:40,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:40,675 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727333425] [2021-11-20 23:18:40,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727333425] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159769871] [2021-11-20 23:18:40,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:40,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:40,676 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:40,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-20 23:18:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:40,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-20 23:18:40,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:41,255 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:41,324 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-20 23:18:41,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 33 treesize of output 32 [2021-11-20 23:18:41,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,371 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:41,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:18:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:41,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:18:41,530 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:41,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:18:41,650 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-20 23:18:41,651 INFO L388 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 36 treesize of output 29 [2021-11-20 23:18:41,653 INFO L388 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 21 treesize of output 19 [2021-11-20 23:18:41,655 INFO L388 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 [2021-11-20 23:18:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:41,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159769871] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:18:41,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797907978] [2021-11-20 23:18:41,859 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:18:41,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:18:41,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2021-11-20 23:18:41,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464718155] [2021-11-20 23:18:41,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:18:41,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-20 23:18:41,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:18:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-20 23:18:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-11-20 23:18:41,861 INFO L87 Difference]: Start difference. First operand 927 states and 1826 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:18:44,847 INFO L93 Difference]: Finished difference Result 1971 states and 3880 transitions. [2021-11-20 23:18:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-20 23:18:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 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 45 [2021-11-20 23:18:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:18:44,850 INFO L225 Difference]: With dead ends: 1971 [2021-11-20 23:18:44,850 INFO L226 Difference]: Without dead ends: 1967 [2021-11-20 23:18:44,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=618, Invalid=2574, Unknown=0, NotChecked=0, Total=3192 [2021-11-20 23:18:44,852 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 524 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:18:44,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [524 Valid, 122 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 2529 Invalid, 0 Unknown, 2 Unchecked, 2.0s Time] [2021-11-20 23:18:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2021-11-20 23:18:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1003. [2021-11-20 23:18:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 996 states have (on average 1.9839357429718876) internal successors, (1976), 1002 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1976 transitions. [2021-11-20 23:18:44,880 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1976 transitions. Word has length 45 [2021-11-20 23:18:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:18:44,881 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1976 transitions. [2021-11-20 23:18:44,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:18:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1976 transitions. [2021-11-20 23:18:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:18:44,882 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:18:44,883 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:18:44,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-20 23:18:45,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:45,107 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:18:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:18:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 918896645, now seen corresponding path program 1 times [2021-11-20 23:18:45,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:18:45,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324197146] [2021-11-20 23:18:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:45,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:18:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:18:45,777 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:18:45,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324197146] [2021-11-20 23:18:45,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324197146] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:18:45,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897898305] [2021-11-20 23:18:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:18:45,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:18:45,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:18:45,780 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:18:45,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-20 23:18:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:18:45,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-20 23:18:45,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:18:46,108 INFO L388 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 11 treesize of output 7 [2021-11-20 23:18:46,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,161 INFO L388 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 21 treesize of output 20 [2021-11-20 23:18:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:18:46,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:18:46,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:18:46,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:18:46,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:18:46,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:18:46,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:18:47,165 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-20 23:18:47,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 127 [2021-11-20 23:19:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:19:03,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:20:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:20:38,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897898305] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:20:38,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [108066672] [2021-11-20 23:20:38,958 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:20:38,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:20:38,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 37 [2021-11-20 23:20:38,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043203979] [2021-11-20 23:20:38,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:20:38,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-20 23:20:38,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:20:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-20 23:20:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1122, Unknown=42, NotChecked=0, Total=1406 [2021-11-20 23:20:38,961 INFO L87 Difference]: Start difference. First operand 1003 states and 1976 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:10,954 INFO L93 Difference]: Finished difference Result 1717 states and 3400 transitions. [2021-11-20 23:21:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 23:21:10,955 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:21:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:10,958 INFO L225 Difference]: With dead ends: 1717 [2021-11-20 23:21:10,958 INFO L226 Difference]: Without dead ends: 1717 [2021-11-20 23:21:10,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 141.3s TimeCoverageRelationStatistics Valid=621, Invalid=1976, Unknown=55, NotChecked=0, Total=2652 [2021-11-20 23:21:10,960 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 366 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1211 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:10,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 156 Invalid, 2168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 879 Invalid, 0 Unknown, 1211 Unchecked, 0.9s Time] [2021-11-20 23:21:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2021-11-20 23:21:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1013. [2021-11-20 23:21:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1006 states have (on average 1.9840954274353877) internal successors, (1996), 1012 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1996 transitions. [2021-11-20 23:21:10,987 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1996 transitions. Word has length 45 [2021-11-20 23:21:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:10,987 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1996 transitions. [2021-11-20 23:21:10,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1996 transitions. [2021-11-20 23:21:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:21:10,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:10,990 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:21:11,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:11,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-20 23:21:11,211 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:21:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash -575781913, now seen corresponding path program 2 times [2021-11-20 23:21:11,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:11,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665701047] [2021-11-20 23:21:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:11,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:11,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:11,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665701047] [2021-11-20 23:21:11,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665701047] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:11,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676257795] [2021-11-20 23:21:11,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:21:11,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:11,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:11,825 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:11,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-20 23:21:11,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:21:11,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:11,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-20 23:21:11,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:12,041 INFO L388 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 [2021-11-20 23:21:12,114 INFO L388 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 11 treesize of output 7 [2021-11-20 23:21:12,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,177 INFO L388 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 21 treesize of output 20 [2021-11-20 23:21:12,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:21:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:21:12,522 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:21:12,523 INFO L388 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 19 treesize of output 11 [2021-11-20 23:21:12,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:21:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:21:12,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:12,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:21:13,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:21:13,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:13,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2021-11-20 23:21:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:21:13,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:17,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:17,401 INFO L388 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 50 treesize of output 48 [2021-11-20 23:21:17,403 INFO L388 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 50 treesize of output 46 [2021-11-20 23:21:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:21:17,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676257795] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:17,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:21:17,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 13] total 35 [2021-11-20 23:21:17,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563334841] [2021-11-20 23:21:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:21:17,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:21:17,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:21:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:21:17,448 INFO L87 Difference]: Start difference. First operand 1013 states and 1996 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:17,896 INFO L93 Difference]: Finished difference Result 1302 states and 2565 transitions. [2021-11-20 23:21:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:21:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:21:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:17,899 INFO L225 Difference]: With dead ends: 1302 [2021-11-20 23:21:17,899 INFO L226 Difference]: Without dead ends: 1302 [2021-11-20 23:21:17,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2021-11-20 23:21:17,899 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:17,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 192 Unchecked, 0.2s Time] [2021-11-20 23:21:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-11-20 23:21:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1014. [2021-11-20 23:21:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1007 states have (on average 1.984111221449851) internal successors, (1998), 1013 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1998 transitions. [2021-11-20 23:21:17,917 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1998 transitions. Word has length 45 [2021-11-20 23:21:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:17,917 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 1998 transitions. [2021-11-20 23:21:17,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1998 transitions. [2021-11-20 23:21:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:21:17,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:17,919 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:21:17,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-20 23:21:18,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-20 23:21:18,148 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:21:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash -141243367, now seen corresponding path program 3 times [2021-11-20 23:21:18,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:18,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165504100] [2021-11-20 23:21:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:18,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:18,931 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165504100] [2021-11-20 23:21:18,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165504100] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:18,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260521564] [2021-11-20 23:21:18,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:21:18,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:18,933 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:18,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-20 23:21:19,172 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:21:19,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:21:19,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-20 23:21:19,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:19,464 INFO L388 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 11 treesize of output 7 [2021-11-20 23:21:19,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,517 INFO L388 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 21 treesize of output 20 [2021-11-20 23:21:19,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:21:19,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:21:19,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:19,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:21:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:21:20,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:21:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:21:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:20,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2021-11-20 23:21:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:20,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:21:25,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:25,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:25,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:25,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:25,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:25,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:26,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:26,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:26,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:21:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:26,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260521564] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:21:26,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725806220] [2021-11-20 23:21:26,342 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:21:26,343 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:21:26,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-20 23:21:26,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675670529] [2021-11-20 23:21:26,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:21:26,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 23:21:26,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:21:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 23:21:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:21:26,346 INFO L87 Difference]: Start difference. First operand 1014 states and 1998 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:21:27,980 INFO L93 Difference]: Finished difference Result 1642 states and 3245 transitions. [2021-11-20 23:21:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-20 23:21:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:21:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:21:27,983 INFO L225 Difference]: With dead ends: 1642 [2021-11-20 23:21:27,984 INFO L226 Difference]: Without dead ends: 1642 [2021-11-20 23:21:27,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=568, Invalid=1982, Unknown=0, NotChecked=0, Total=2550 [2021-11-20 23:21:27,984 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 188 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:21:27,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 218 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 576 Invalid, 0 Unknown, 331 Unchecked, 0.5s Time] [2021-11-20 23:21:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2021-11-20 23:21:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1015. [2021-11-20 23:21:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1008 states have (on average 1.9841269841269842) internal successors, (2000), 1014 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 2000 transitions. [2021-11-20 23:21:28,006 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 2000 transitions. Word has length 45 [2021-11-20 23:21:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:21:28,006 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 2000 transitions. [2021-11-20 23:21:28,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:21:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2000 transitions. [2021-11-20 23:21:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:21:28,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:21:28,008 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:21:28,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2021-11-20 23:21:28,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-20 23:21:28,210 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:21:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:21:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash -970453033, now seen corresponding path program 4 times [2021-11-20 23:21:28,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:21:28,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098148610] [2021-11-20 23:21:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:21:28,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:21:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:29,115 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:21:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098148610] [2021-11-20 23:21:29,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098148610] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:21:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663504141] [2021-11-20 23:21:29,116 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:21:29,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:21:29,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:21:29,120 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:21:29,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-20 23:21:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:21:29,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:21:29,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:21:29,504 INFO L388 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 11 treesize of output 7 [2021-11-20 23:21:29,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,572 INFO L388 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 21 treesize of output 20 [2021-11-20 23:21:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:21:29,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:29,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:21:30,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:21:30,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:21:30,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:21:30,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:21:30,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:21:30,857 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-20 23:21:30,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 127 [2021-11-20 23:21:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:21:40,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:22:44,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (select .cse0 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse4 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_83|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_83|))) is different from false [2021-11-20 23:23:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-20 23:23:04,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663504141] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257005527] [2021-11-20 23:23:04,892 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:04,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:04,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-20 23:23:04,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609949150] [2021-11-20 23:23:04,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:04,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 23:23:04,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:04,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 23:23:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1149, Unknown=38, NotChecked=72, Total=1482 [2021-11-20 23:23:04,895 INFO L87 Difference]: Start difference. First operand 1015 states and 2000 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:07,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| Int)) (or (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_83|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_353|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_83|))) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:23:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:36,073 INFO L93 Difference]: Finished difference Result 3047 states and 6068 transitions. [2021-11-20 23:23:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 23:23:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:23:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:36,093 INFO L225 Difference]: With dead ends: 3047 [2021-11-20 23:23:36,094 INFO L226 Difference]: Without dead ends: 3047 [2021-11-20 23:23:36,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 122.5s TimeCoverageRelationStatistics Valid=727, Invalid=2537, Unknown=50, NotChecked=226, Total=3540 [2021-11-20 23:23:36,095 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 396 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1455 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:36,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 238 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1636 Invalid, 0 Unknown, 1455 Unchecked, 1.6s Time] [2021-11-20 23:23:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3047 states. [2021-11-20 23:23:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3047 to 1017. [2021-11-20 23:23:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1010 states have (on average 1.9841584158415841) internal successors, (2004), 1016 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 2004 transitions. [2021-11-20 23:23:36,135 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 2004 transitions. Word has length 45 [2021-11-20 23:23:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:36,136 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 2004 transitions. [2021-11-20 23:23:36,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2004 transitions. [2021-11-20 23:23:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:23:36,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:36,138 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:23:36,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:36,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:36,363 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:23:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1189918357, now seen corresponding path program 5 times [2021-11-20 23:23:36,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:36,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860788195] [2021-11-20 23:23:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:36,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:23:37,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:37,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860788195] [2021-11-20 23:23:37,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860788195] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:37,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302221457] [2021-11-20 23:23:37,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:23:37,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:37,041 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:37,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-11-20 23:23:37,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:23:37,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:37,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-20 23:23:37,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:37,327 INFO L388 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 [2021-11-20 23:23:37,418 INFO L388 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 11 treesize of output 7 [2021-11-20 23:23:37,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,490 INFO L388 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 21 treesize of output 20 [2021-11-20 23:23:37,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:23:37,786 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:23:37,787 INFO L388 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 19 treesize of output 11 [2021-11-20 23:23:37,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:23:37,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:37,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:23:38,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:23:38,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:23:38,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:23:38,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:38,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2021-11-20 23:23:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:23:38,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:43,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:43,962 INFO L388 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 50 treesize of output 48 [2021-11-20 23:23:43,964 INFO L388 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 50 treesize of output 46 [2021-11-20 23:23:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:23:44,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302221457] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:44,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:23:44,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 13] total 35 [2021-11-20 23:23:44,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732866934] [2021-11-20 23:23:44,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:23:44,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:23:44,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:23:44,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2021-11-20 23:23:44,008 INFO L87 Difference]: Start difference. First operand 1017 states and 2004 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:46,147 INFO L93 Difference]: Finished difference Result 1304 states and 2570 transitions. [2021-11-20 23:23:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:23:46,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:23:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:46,150 INFO L225 Difference]: With dead ends: 1304 [2021-11-20 23:23:46,150 INFO L226 Difference]: Without dead ends: 1304 [2021-11-20 23:23:46,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:23:46,150 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:46,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 35 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 744 Unchecked, 0.2s Time] [2021-11-20 23:23:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-11-20 23:23:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1018. [2021-11-20 23:23:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1011 states have (on average 1.9841740850642928) internal successors, (2006), 1017 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2006 transitions. [2021-11-20 23:23:46,170 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2006 transitions. Word has length 45 [2021-11-20 23:23:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:46,170 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2006 transitions. [2021-11-20 23:23:46,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2006 transitions. [2021-11-20 23:23:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:23:46,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:46,172 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:23:46,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-11-20 23:23:46,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-11-20 23:23:46,391 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:23:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:23:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 317366969, now seen corresponding path program 6 times [2021-11-20 23:23:46,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:23:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098889415] [2021-11-20 23:23:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:23:46,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:23:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:23:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:23:47,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:23:47,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098889415] [2021-11-20 23:23:47,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098889415] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:23:47,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260859813] [2021-11-20 23:23:47,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:23:47,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:23:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:23:47,154 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:23:47,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-11-20 23:23:47,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:23:47,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:23:47,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-20 23:23:47,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:23:47,696 INFO L388 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 11 treesize of output 7 [2021-11-20 23:23:47,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:47,769 INFO L388 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 21 treesize of output 20 [2021-11-20 23:23:47,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:47,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:23:48,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:23:48,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:23:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:23:48,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:23:48,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:48,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:23:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:23:49,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2021-11-20 23:23:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:23:49,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:23:56,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:23:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:23:56,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260859813] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:23:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416489459] [2021-11-20 23:23:56,629 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:23:56,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:23:56,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 37 [2021-11-20 23:23:56,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115120275] [2021-11-20 23:23:56,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:23:56,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-20 23:23:56,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:23:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-20 23:23:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2021-11-20 23:23:56,632 INFO L87 Difference]: Start difference. First operand 1018 states and 2006 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:23:59,907 INFO L93 Difference]: Finished difference Result 1687 states and 3340 transitions. [2021-11-20 23:23:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-20 23:23:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:23:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:23:59,921 INFO L225 Difference]: With dead ends: 1687 [2021-11-20 23:23:59,921 INFO L226 Difference]: Without dead ends: 1687 [2021-11-20 23:23:59,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 69 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=825, Invalid=2481, Unknown=0, NotChecked=0, Total=3306 [2021-11-20 23:23:59,922 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 341 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 497 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:23:59,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 172 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1209 Invalid, 0 Unknown, 497 Unchecked, 1.4s Time] [2021-11-20 23:23:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2021-11-20 23:23:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1019. [2021-11-20 23:23:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1012 states have (on average 1.9841897233201582) internal successors, (2008), 1018 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2008 transitions. [2021-11-20 23:23:59,944 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2008 transitions. Word has length 45 [2021-11-20 23:23:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:23:59,944 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 2008 transitions. [2021-11-20 23:23:59,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:23:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2008 transitions. [2021-11-20 23:23:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:23:59,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:23:59,946 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:23:59,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:00,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-11-20 23:24:00,160 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:24:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash -791452877, now seen corresponding path program 7 times [2021-11-20 23:24:00,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:00,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050565400] [2021-11-20 23:24:00,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:00,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:24:00,899 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:00,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050565400] [2021-11-20 23:24:00,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050565400] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:00,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7897389] [2021-11-20 23:24:00,900 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:24:00,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:00,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:00,901 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:00,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-20 23:24:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:00,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-20 23:24:00,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:01,207 INFO L388 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 11 treesize of output 7 [2021-11-20 23:24:01,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,252 INFO L388 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 21 treesize of output 20 [2021-11-20 23:24:01,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:24:01,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:24:01,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:24:01,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:24:01,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:24:01,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:01,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:24:02,284 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-20 23:24:02,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 127 [2021-11-20 23:24:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:24:06,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:24:11,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8)) 0))))) is different from false [2021-11-20 23:24:13,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_86| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse4 (let ((.cse5 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8)) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_86|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_86|))) is different from false [2021-11-20 23:24:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:24:50,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7897389] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:24:50,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881678260] [2021-11-20 23:24:50,649 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:24:50,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:24:50,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-20 23:24:50,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711359087] [2021-11-20 23:24:50,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:24:50,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 23:24:50,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:24:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 23:24:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1107, Unknown=13, NotChecked=142, Total=1482 [2021-11-20 23:24:50,651 INFO L87 Difference]: Start difference. First operand 1019 states and 2008 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:53,199 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_86| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9)) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_86|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_86|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:24:55,233 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse3 (let ((.cse4 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int)) (= (let ((.cse9 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356|) 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_356| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse9)) 0))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-20 23:24:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:24:56,134 INFO L93 Difference]: Finished difference Result 2814 states and 5602 transitions. [2021-11-20 23:24:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-20 23:24:56,134 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:24:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:24:56,138 INFO L225 Difference]: With dead ends: 2814 [2021-11-20 23:24:56,138 INFO L226 Difference]: Without dead ends: 2814 [2021-11-20 23:24:56,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=293, Invalid=1430, Unknown=15, NotChecked=332, Total=2070 [2021-11-20 23:24:56,139 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 353 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 613 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:24:56,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 201 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 890 Invalid, 0 Unknown, 613 Unchecked, 1.0s Time] [2021-11-20 23:24:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2021-11-20 23:24:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 1022. [2021-11-20 23:24:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1015 states have (on average 1.9842364532019705) internal successors, (2014), 1021 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2014 transitions. [2021-11-20 23:24:56,184 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2014 transitions. Word has length 45 [2021-11-20 23:24:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:24:56,185 INFO L470 AbstractCegarLoop]: Abstraction has 1022 states and 2014 transitions. [2021-11-20 23:24:56,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:24:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2014 transitions. [2021-11-20 23:24:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:24:56,187 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:24:56,187 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:24:56,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-11-20 23:24:56,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:56,416 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:24:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:24:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash -640472957, now seen corresponding path program 8 times [2021-11-20 23:24:56,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:24:56,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756718975] [2021-11-20 23:24:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:24:56,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:24:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:24:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:24:57,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:24:57,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756718975] [2021-11-20 23:24:57,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756718975] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:24:57,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210072888] [2021-11-20 23:24:57,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 23:24:57,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:24:57,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:24:57,082 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:24:57,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-11-20 23:24:57,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 23:24:57,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:24:57,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-20 23:24:57,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:24:57,362 INFO L388 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 [2021-11-20 23:24:57,444 INFO L388 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 11 treesize of output 7 [2021-11-20 23:24:57,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,514 INFO L388 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 21 treesize of output 20 [2021-11-20 23:24:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:24:57,815 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-20 23:24:57,816 INFO L388 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 19 treesize of output 11 [2021-11-20 23:24:57,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:57,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-20 23:24:58,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:24:58,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:24:58,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:24:58,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 75 [2021-11-20 23:24:58,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:24:58,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2021-11-20 23:24:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:24:58,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:01,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,551 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,740 INFO L354 Elim1Store]: treesize reduction 793, result has 6.9 percent of original size [2021-11-20 23:25:01,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 73 [2021-11-20 23:25:01,751 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:25:01,751 INFO L388 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 63 treesize of output 57 [2021-11-20 23:25:01,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,761 INFO L354 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2021-11-20 23:25:01,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 46 [2021-11-20 23:25:01,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,772 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,968 INFO L354 Elim1Store]: treesize reduction 579, result has 10.4 percent of original size [2021-11-20 23:25:01,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 81 [2021-11-20 23:25:01,982 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:25:01,982 INFO L388 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 73 treesize of output 65 [2021-11-20 23:25:01,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:01,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,010 INFO L354 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2021-11-20 23:25:02,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 34 [2021-11-20 23:25:02,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,206 INFO L354 Elim1Store]: treesize reduction 599, result has 7.3 percent of original size [2021-11-20 23:25:02,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 59 [2021-11-20 23:25:02,219 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-20 23:25:02,219 INFO L388 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 51 treesize of output 47 [2021-11-20 23:25:02,222 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:02,235 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-20 23:25:02,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 24 [2021-11-20 23:25:02,386 INFO L388 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 42 treesize of output 40 [2021-11-20 23:25:02,389 INFO L388 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 42 treesize of output 38 [2021-11-20 23:25:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-20 23:25:02,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210072888] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:02,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 23:25:02,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 13] total 34 [2021-11-20 23:25:02,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266988329] [2021-11-20 23:25:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:25:02,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-20 23:25:02,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 23:25:02,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:25:02,428 INFO L87 Difference]: Start difference. First operand 1022 states and 2014 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:02,595 INFO L93 Difference]: Finished difference Result 1204 states and 2372 transitions. [2021-11-20 23:25:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-20 23:25:02,595 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-20 23:25:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:02,597 INFO L225 Difference]: With dead ends: 1204 [2021-11-20 23:25:02,597 INFO L226 Difference]: Without dead ends: 1204 [2021-11-20 23:25:02,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2021-11-20 23:25:02,597 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:02,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 25 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 263 Unchecked, 0.2s Time] [2021-11-20 23:25:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-11-20 23:25:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1023. [2021-11-20 23:25:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1016 states have (on average 1.984251968503937) internal successors, (2016), 1022 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 2016 transitions. [2021-11-20 23:25:02,613 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 2016 transitions. Word has length 45 [2021-11-20 23:25:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:02,614 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 2016 transitions. [2021-11-20 23:25:02,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 2016 transitions. [2021-11-20 23:25:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:25:02,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:02,615 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:25:02,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-11-20 23:25:02,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-11-20 23:25:02,816 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:25:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 405758591, now seen corresponding path program 9 times [2021-11-20 23:25:02,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656690310] [2021-11-20 23:25:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:02,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:25:03,644 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:03,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656690310] [2021-11-20 23:25:03,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656690310] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:03,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992813151] [2021-11-20 23:25:03,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 23:25:03,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:03,649 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:03,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-11-20 23:25:03,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 23:25:03,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 23:25:03,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-20 23:25:03,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:04,337 INFO L388 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 11 treesize of output 7 [2021-11-20 23:25:04,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,404 INFO L388 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 21 treesize of output 20 [2021-11-20 23:25:04,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:25:04,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:25:04,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:04,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:25:05,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:25:05,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:25:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:25:05,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:05,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2021-11-20 23:25:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:25:05,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:25:11,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 23:25:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:25:11,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992813151] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 23:25:11,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [717828674] [2021-11-20 23:25:11,525 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:1603) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-11-20 23:25:11,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 23:25:11,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-20 23:25:11,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820265731] [2021-11-20 23:25:11,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 23:25:11,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-20 23:25:11,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:25:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-20 23:25:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2021-11-20 23:25:11,527 INFO L87 Difference]: Start difference. First operand 1023 states and 2016 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:25:15,241 INFO L93 Difference]: Finished difference Result 1706 states and 3377 transitions. [2021-11-20 23:25:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 23:25:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2021-11-20 23:25:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:25:15,244 INFO L225 Difference]: With dead ends: 1706 [2021-11-20 23:25:15,244 INFO L226 Difference]: Without dead ends: 1705 [2021-11-20 23:25:15,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=685, Invalid=2177, Unknown=0, NotChecked=0, Total=2862 [2021-11-20 23:25:15,245 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 328 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 968 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-20 23:25:15,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 164 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1877 Invalid, 0 Unknown, 968 Unchecked, 2.5s Time] [2021-11-20 23:25:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2021-11-20 23:25:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1038. [2021-11-20 23:25:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1031 states have (on average 1.9844810863239573) internal successors, (2046), 1037 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 2046 transitions. [2021-11-20 23:25:15,274 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 2046 transitions. Word has length 45 [2021-11-20 23:25:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:25:15,274 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 2046 transitions. [2021-11-20 23:25:15,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 23:25:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 2046 transitions. [2021-11-20 23:25:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-20 23:25:15,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:25:15,276 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1] [2021-11-20 23:25:15,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-11-20 23:25:15,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-11-20 23:25:15,490 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-20 23:25:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:25:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 840297137, now seen corresponding path program 10 times [2021-11-20 23:25:15,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:25:15,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289379564] [2021-11-20 23:25:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:25:15,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:25:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:25:16,437 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:25:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289379564] [2021-11-20 23:25:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289379564] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:25:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242709350] [2021-11-20 23:25:16,437 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-20 23:25:16,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:25:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:25:16,438 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:25:16,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f96bd1d-4d6f-48aa-a06f-39c2e284b653/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-11-20 23:25:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:25:16,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-20 23:25:16,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:25:16,809 INFO L388 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 11 treesize of output 7 [2021-11-20 23:25:16,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:16,873 INFO L388 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 21 treesize of output 20 [2021-11-20 23:25:17,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-20 23:25:17,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-20 23:25:17,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-20 23:25:17,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-20 23:25:17,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-20 23:25:17,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:25:17,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-20 23:25:18,242 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-20 23:25:18,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 127 [2021-11-20 23:25:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-20 23:25:30,381 INFO L328 TraceCheckSpWp]: Computing backward predicates...