./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs --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 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 14:01:35,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 14:01:35,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 14:01:35,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 14:01:35,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 14:01:35,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 14:01:35,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 14:01:35,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 14:01:35,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 14:01:35,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 14:01:35,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 14:01:35,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 14:01:35,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 14:01:35,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 14:01:35,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 14:01:35,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 14:01:35,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 14:01:35,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 14:01:35,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 14:01:35,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 14:01:35,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 14:01:35,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 14:01:35,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 14:01:35,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 14:01:35,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 14:01:35,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 14:01:35,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 14:01:35,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 14:01:35,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 14:01:35,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 14:01:35,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 14:01:35,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 14:01:35,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 14:01:35,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 14:01:35,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 14:01:35,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 14:01:35,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 14:01:35,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 14:01:35,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 14:01:35,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 14:01:35,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 14:01:35,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-19 14:01:35,270 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 14:01:35,271 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 14:01:35,272 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 14:01:35,272 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 14:01:35,272 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 14:01:35,273 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 14:01:35,273 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 14:01:35,273 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 14:01:35,280 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 14:01:35,280 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 14:01:35,281 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 14:01:35,281 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 14:01:35,281 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 14:01:35,282 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 14:01:35,282 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 14:01:35,282 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 14:01:35,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 14:01:35,283 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 14:01:35,283 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 14:01:35,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 14:01:35,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 14:01:35,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 14:01:35,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 14:01:35,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 14:01:35,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 14:01:35,285 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-19 14:01:35,285 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 14:01:35,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 14:01:35,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 14:01:35,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 14:01:35,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 14:01:35,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 14:01:35,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 14:01:35,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:35,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 14:01:35,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 14:01:35,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 14:01:35,289 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 14:01:35,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 14:01:35,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 14:01:35,290 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 14:01:35,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 14:01:35,291 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_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/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_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs 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 -> 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 [2021-11-19 14:01:35,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 14:01:35,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 14:01:35,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 14:01:35,657 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 14:01:35,658 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 14:01:35,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2021-11-19 14:01:35,746 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/data/cbaa8bede/555228ff557944668c4cad73ed81a190/FLAG90534325d [2021-11-19 14:01:36,263 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 14:01:36,263 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2021-11-19 14:01:36,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/data/cbaa8bede/555228ff557944668c4cad73ed81a190/FLAG90534325d [2021-11-19 14:01:36,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/data/cbaa8bede/555228ff557944668c4cad73ed81a190 [2021-11-19 14:01:36,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 14:01:36,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 14:01:36,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:36,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 14:01:36,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 14:01:36,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:36" (1/1) ... [2021-11-19 14:01:36,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7d8eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:36, skipping insertion in model container [2021-11-19 14:01:36,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:01:36" (1/1) ... [2021-11-19 14:01:36,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 14:01:36,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 14:01:37,205 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:37,221 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 14:01:37,261 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 14:01:37,318 INFO L208 MainTranslator]: Completed translation [2021-11-19 14:01:37,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37 WrapperNode [2021-11-19 14:01:37,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 14:01:37,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:37,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 14:01:37,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 14:01:37,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,374 INFO L137 Inliner]: procedures = 261, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2021-11-19 14:01:37,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 14:01:37,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 14:01:37,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 14:01:37,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 14:01:37,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 14:01:37,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 14:01:37,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 14:01:37,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 14:01:37,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (1/1) ... [2021-11-19 14:01:37,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 14:01:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:37,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 14:01:37,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 14:01:37,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 14:01:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 14:01:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 14:01:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 14:01:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-19 14:01:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-19 14:01:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-19 14:01:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 14:01:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 14:01:37,513 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-19 14:01:37,668 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 14:01:37,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 14:01:38,076 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 14:01:38,085 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 14:01:38,103 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-19 14:01:38,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:38 BoogieIcfgContainer [2021-11-19 14:01:38,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 14:01:38,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 14:01:38,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 14:01:38,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 14:01:38,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 02:01:36" (1/3) ... [2021-11-19 14:01:38,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf7e48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:38, skipping insertion in model container [2021-11-19 14:01:38,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:01:37" (2/3) ... [2021-11-19 14:01:38,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf7e48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 02:01:38, skipping insertion in model container [2021-11-19 14:01:38,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:01:38" (3/3) ... [2021-11-19 14:01:38,115 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2021-11-19 14:01:38,120 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-19 14:01:38,129 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 14:01:38,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-19 14:01:38,130 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-19 14:01:38,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,183 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,184 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,188 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-19 14:01:38,189 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-19 14:01:38,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,189 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-19 14:01:38,190 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-19 14:01:38,190 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-19 14:01:38,190 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-19 14:01:38,191 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-19 14:01:38,191 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-19 14:01:38,191 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-19 14:01:38,191 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-19 14:01:38,191 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-19 14:01:38,192 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-19 14:01:38,192 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-19 14:01:38,192 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-19 14:01:38,192 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-19 14:01:38,192 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-19 14:01:38,193 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-19 14:01:38,193 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-19 14:01:38,193 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-19 14:01:38,193 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-19 14:01:38,194 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-19 14:01:38,194 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-19 14:01:38,195 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-19 14:01:38,195 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-19 14:01:38,195 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-19 14:01:38,196 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-19 14:01:38,196 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-19 14:01:38,196 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-19 14:01:38,196 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-19 14:01:38,197 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-19 14:01:38,197 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-19 14:01:38,198 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-19 14:01:38,198 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-19 14:01:38,198 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-19 14:01:38,198 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-19 14:01:38,199 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-19 14:01:38,199 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-19 14:01:38,199 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-19 14:01:38,199 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-19 14:01:38,200 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-19 14:01:38,200 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-19 14:01:38,200 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-19 14:01:38,200 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-19 14:01:38,200 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-19 14:01:38,201 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-19 14:01:38,201 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-19 14:01:38,202 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-19 14:01:38,202 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-19 14:01:38,202 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-19 14:01:38,202 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-19 14:01:38,203 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-19 14:01:38,203 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-19 14:01:38,203 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-19 14:01:38,203 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-19 14:01:38,204 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-19 14:01:38,204 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-19 14:01:38,205 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-19 14:01:38,206 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-19 14:01:38,209 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-19 14:01:38,209 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-19 14:01:38,210 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-19 14:01:38,210 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-19 14:01:38,210 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-19 14:01:38,211 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-19 14:01:38,211 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-19 14:01:38,211 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-19 14:01:38,212 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-19 14:01:38,217 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-19 14:01:38,218 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-19 14:01:38,218 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-19 14:01:38,218 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-19 14:01:38,218 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-19 14:01:38,219 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-19 14:01:38,219 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-19 14:01:38,219 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-19 14:01:38,219 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-19 14:01:38,220 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-19 14:01:38,221 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-19 14:01:38,221 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-19 14:01:38,221 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-19 14:01:38,221 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-19 14:01:38,221 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-19 14:01:38,222 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-19 14:01:38,222 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-19 14:01:38,222 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-19 14:01:38,222 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-19 14:01:38,223 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-19 14:01:38,223 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-19 14:01:38,223 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-19 14:01:38,223 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-19 14:01:38,224 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-19 14:01:38,224 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-19 14:01:38,224 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-19 14:01:38,225 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-19 14:01:38,225 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-19 14:01:38,225 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-19 14:01:38,225 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-19 14:01:38,225 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-19 14:01:38,226 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-19 14:01:38,226 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-19 14:01:38,226 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-19 14:01:38,226 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-19 14:01:38,227 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-19 14:01:38,227 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-19 14:01:38,227 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-19 14:01:38,227 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-19 14:01:38,227 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-19 14:01:38,228 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-19 14:01:38,228 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-19 14:01:38,228 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-19 14:01:38,228 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-19 14:01:38,229 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-19 14:01:38,229 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-19 14:01:38,229 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-19 14:01:38,229 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-19 14:01:38,230 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-19 14:01:38,230 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-19 14:01:38,230 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-19 14:01:38,230 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-19 14:01:38,230 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-19 14:01:38,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,231 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,232 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,233 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,242 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-19 14:01:38,242 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-19 14:01:38,242 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-19 14:01:38,242 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-19 14:01:38,243 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-19 14:01:38,243 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-19 14:01:38,243 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-19 14:01:38,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 14:01:38,244 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-19 14:01:38,247 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-19 14:01:38,306 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 14:01:38,313 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-19 14:01:38,314 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-19 14:01:38,328 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-19 14:01:38,340 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 124 transitions, 253 flow [2021-11-19 14:01:38,343 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 124 transitions, 253 flow [2021-11-19 14:01:38,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 124 transitions, 253 flow [2021-11-19 14:01:38,439 INFO L129 PetriNetUnfolder]: 6/123 cut-off events. [2021-11-19 14:01:38,440 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-19 14:01:38,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 123 events. 6/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 218 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2021-11-19 14:01:38,455 INFO L116 LiptonReduction]: Number of co-enabled transitions 4636 [2021-11-19 14:01:40,912 INFO L131 LiptonReduction]: Checked pairs total: 13319 [2021-11-19 14:01:40,913 INFO L133 LiptonReduction]: Total number of compositions: 73 [2021-11-19 14:01:40,921 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 113 flow [2021-11-19 14:01:40,954 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-19 14:01:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-19 14:01:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-19 14:01:40,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:40,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:40,967 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1368242416, now seen corresponding path program 1 times [2021-11-19 14:01:40,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:40,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872078070] [2021-11-19 14:01:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:40,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:41,150 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-19 14:01:41,151 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:41,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872078070] [2021-11-19 14:01:41,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872078070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:41,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:41,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 14:01:41,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258751834] [2021-11-19 14:01:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:41,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 14:01:41,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 14:01:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 14:01:41,185 INFO L87 Difference]: Start difference. First operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-19 14:01:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:41,301 INFO L93 Difference]: Finished difference Result 561 states and 1119 transitions. [2021-11-19 14:01:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 14:01:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-19 14:01:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:41,334 INFO L225 Difference]: With dead ends: 561 [2021-11-19 14:01:41,334 INFO L226 Difference]: Without dead ends: 561 [2021-11-19 14:01:41,335 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-19 14:01:41,342 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:41,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:01:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-11-19 14:01:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2021-11-19 14:01:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 547 states have (on average 2.045703839122486) internal successors, (1119), 560 states have internal predecessors, (1119), 0 states have call successors, (0), 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-19 14:01:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2021-11-19 14:01:41,438 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 10 [2021-11-19 14:01:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:41,438 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2021-11-19 14:01:41,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-19 14:01:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2021-11-19 14:01:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 14:01:41,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:41,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:41,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 14:01:41,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -481606668, now seen corresponding path program 1 times [2021-11-19 14:01:41,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:41,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223774645] [2021-11-19 14:01:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:41,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:41,499 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-19 14:01:41,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:41,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223774645] [2021-11-19 14:01:41,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223774645] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:41,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123448675] [2021-11-19 14:01:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:41,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:41,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:41,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:41,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 14:01:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:41,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-19 14:01:41,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 14:01:41,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-19 14:01:41,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123448675] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:41,636 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:01:41,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2021-11-19 14:01:41,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294794266] [2021-11-19 14:01:41,637 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:41,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-19 14:01:41,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-19 14:01:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:41,639 INFO L87 Difference]: Start difference. First operand 561 states and 1119 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:41,760 INFO L93 Difference]: Finished difference Result 867 states and 1731 transitions. [2021-11-19 14:01:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-19 14:01:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-19 14:01:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:41,767 INFO L225 Difference]: With dead ends: 867 [2021-11-19 14:01:41,767 INFO L226 Difference]: Without dead ends: 867 [2021-11-19 14:01:41,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:41,769 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:41,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 84 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:01:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-11-19 14:01:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 831. [2021-11-19 14:01:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 817 states have (on average 2.0746634026927784) internal successors, (1695), 830 states have internal predecessors, (1695), 0 states have call successors, (0), 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-19 14:01:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1695 transitions. [2021-11-19 14:01:41,860 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1695 transitions. Word has length 11 [2021-11-19 14:01:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:41,860 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1695 transitions. [2021-11-19 14:01:41,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1695 transitions. [2021-11-19 14:01:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-19 14:01:41,862 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:41,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:41,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:42,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:42,079 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:42,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2058689426, now seen corresponding path program 1 times [2021-11-19 14:01:42,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:42,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98118626] [2021-11-19 14:01:42,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:42,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:42,182 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-19 14:01:42,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:42,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98118626] [2021-11-19 14:01:42,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98118626] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:42,183 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030738260] [2021-11-19 14:01:42,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:42,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:42,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:42,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 14:01:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:42,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 14:01:42,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:42,325 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-19 14:01:42,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:42,389 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-19 14:01:42,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030738260] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:01:42,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [792143815] [2021-11-19 14:01:42,397 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-19 14:01:42,400 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:01:42,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-11-19 14:01:42,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511244478] [2021-11-19 14:01:42,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:01:42,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:01:42,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:01:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:42,405 INFO L87 Difference]: Start difference. First operand 831 states and 1695 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-19 14:01:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:42,493 INFO L93 Difference]: Finished difference Result 834 states and 1698 transitions. [2021-11-19 14:01:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:01:42,494 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-19 14:01:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:42,500 INFO L225 Difference]: With dead ends: 834 [2021-11-19 14:01:42,501 INFO L226 Difference]: Without dead ends: 834 [2021-11-19 14:01:42,501 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-19 14:01:42,502 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:42,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:01:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2021-11-19 14:01:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2021-11-19 14:01:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 820 states have (on average 2.0707317073170732) internal successors, (1698), 833 states have internal predecessors, (1698), 0 states have call successors, (0), 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-19 14:01:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1698 transitions. [2021-11-19 14:01:42,557 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1698 transitions. Word has length 12 [2021-11-19 14:01:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:42,558 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1698 transitions. [2021-11-19 14:01:42,558 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-19 14:01:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1698 transitions. [2021-11-19 14:01:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 14:01:42,561 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:42,561 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:42,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:42,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:42,787 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1058569482, now seen corresponding path program 2 times [2021-11-19 14:01:42,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:42,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229241709] [2021-11-19 14:01:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:42,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:42,907 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-19 14:01:42,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:42,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229241709] [2021-11-19 14:01:42,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229241709] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:42,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196161880] [2021-11-19 14:01:42,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:01:42,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:42,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:42,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:42,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 14:01:42,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:01:42,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:42,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 14:01:42,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:43,039 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-19 14:01:43,077 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-19 14:01:43,078 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-19 14:01:43,137 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-19 14:01:43,138 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-19 14:01:43,201 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-19 14:01:43,202 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-19 14:01:43,252 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-19 14:01:43,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:43,347 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-19 14:01:43,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196161880] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:43,348 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:01:43,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2021-11-19 14:01:43,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409812711] [2021-11-19 14:01:43,348 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:43,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:01:43,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:01:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-19 14:01:43,351 INFO L87 Difference]: Start difference. First operand 834 states and 1698 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-19 14:01:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:43,644 INFO L93 Difference]: Finished difference Result 1037 states and 2103 transitions. [2021-11-19 14:01:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:01:43,645 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-19 14:01:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:43,652 INFO L225 Difference]: With dead ends: 1037 [2021-11-19 14:01:43,652 INFO L226 Difference]: Without dead ends: 1037 [2021-11-19 14:01:43,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-19 14:01:43,658 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:43,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 36 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 14:01:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-11-19 14:01:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 969. [2021-11-19 14:01:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 955 states have (on average 2.0596858638743454) internal successors, (1967), 968 states have internal predecessors, (1967), 0 states have call successors, (0), 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-19 14:01:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1967 transitions. [2021-11-19 14:01:43,701 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1967 transitions. Word has length 15 [2021-11-19 14:01:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:43,705 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 1967 transitions. [2021-11-19 14:01:43,706 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-19 14:01:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1967 transitions. [2021-11-19 14:01:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 14:01:43,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:43,713 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:43,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:43,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:43,920 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:43,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1717645180, now seen corresponding path program 1 times [2021-11-19 14:01:43,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:43,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085834060] [2021-11-19 14:01:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:43,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:43,993 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-19 14:01:43,993 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:43,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085834060] [2021-11-19 14:01:43,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085834060] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:43,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802973724] [2021-11-19 14:01:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:43,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:43,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:44,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:44,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 14:01:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:44,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 14:01:44,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:44,115 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-19 14:01:44,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:44,196 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-19 14:01:44,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802973724] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:01:44,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319582317] [2021-11-19 14:01:44,197 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-19 14:01:44,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:01:44,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-19 14:01:44,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166416663] [2021-11-19 14:01:44,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:01:44,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-19 14:01:44,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:44,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-19 14:01:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-19 14:01:44,208 INFO L87 Difference]: Start difference. First operand 969 states and 1967 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-19 14:01:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:44,301 INFO L93 Difference]: Finished difference Result 975 states and 1973 transitions. [2021-11-19 14:01:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 14:01:44,301 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-19 14:01:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:44,309 INFO L225 Difference]: With dead ends: 975 [2021-11-19 14:01:44,309 INFO L226 Difference]: Without dead ends: 975 [2021-11-19 14:01:44,310 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-19 14:01:44,311 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:44,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 14:01:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-11-19 14:01:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2021-11-19 14:01:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 961 states have (on average 2.053069719042664) internal successors, (1973), 974 states have internal predecessors, (1973), 0 states have call successors, (0), 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-19 14:01:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1973 transitions. [2021-11-19 14:01:44,351 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1973 transitions. Word has length 15 [2021-11-19 14:01:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:44,352 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1973 transitions. [2021-11-19 14:01:44,352 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-19 14:01:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1973 transitions. [2021-11-19 14:01:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-19 14:01:44,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:44,353 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 14:01:44,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:44,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:44,568 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 564448004, now seen corresponding path program 2 times [2021-11-19 14:01:44,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:44,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542384159] [2021-11-19 14:01:44,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:44,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:44,720 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-19 14:01:44,720 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:44,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542384159] [2021-11-19 14:01:44,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542384159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:44,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:44,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 14:01:44,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639831188] [2021-11-19 14:01:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:44,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:01:44,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:44,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:01:44,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:44,723 INFO L87 Difference]: Start difference. First operand 975 states and 1973 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-19 14:01:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:45,214 INFO L93 Difference]: Finished difference Result 1166 states and 2360 transitions. [2021-11-19 14:01:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:01:45,214 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-19 14:01:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:45,223 INFO L225 Difference]: With dead ends: 1166 [2021-11-19 14:01:45,223 INFO L226 Difference]: Without dead ends: 1166 [2021-11-19 14:01:45,223 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-19 14:01:45,224 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:45,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 27 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-19 14:01:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2021-11-19 14:01:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1096. [2021-11-19 14:01:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1083 states have (on average 2.0480147737765466) internal successors, (2218), 1095 states have internal predecessors, (2218), 0 states have call successors, (0), 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-19 14:01:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 2218 transitions. [2021-11-19 14:01:45,262 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 2218 transitions. Word has length 21 [2021-11-19 14:01:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:45,263 INFO L470 AbstractCegarLoop]: Abstraction has 1096 states and 2218 transitions. [2021-11-19 14:01:45,263 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-19 14:01:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 2218 transitions. [2021-11-19 14:01:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:01:45,265 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:45,265 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-19 14:01:45,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 14:01:45,265 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2124852663, now seen corresponding path program 1 times [2021-11-19 14:01:45,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:45,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278756230] [2021-11-19 14:01:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:45,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:45,438 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-19 14:01:45,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:45,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278756230] [2021-11-19 14:01:45,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278756230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:45,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:45,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 14:01:45,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701890532] [2021-11-19 14:01:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:45,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:01:45,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:01:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:45,441 INFO L87 Difference]: Start difference. First operand 1096 states and 2218 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-19 14:01:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:45,668 INFO L93 Difference]: Finished difference Result 1229 states and 2483 transitions. [2021-11-19 14:01:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:01:45,669 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-19 14:01:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:45,679 INFO L225 Difference]: With dead ends: 1229 [2021-11-19 14:01:45,679 INFO L226 Difference]: Without dead ends: 1229 [2021-11-19 14:01:45,679 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-19 14:01:45,681 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:45,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 36 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 14:01:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2021-11-19 14:01:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2021-11-19 14:01:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1216 states have (on average 2.041940789473684) internal successors, (2483), 1228 states have internal predecessors, (2483), 0 states have call successors, (0), 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-19 14:01:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2483 transitions. [2021-11-19 14:01:45,724 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2483 transitions. Word has length 27 [2021-11-19 14:01:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:45,724 INFO L470 AbstractCegarLoop]: Abstraction has 1229 states and 2483 transitions. [2021-11-19 14:01:45,725 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-19 14:01:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2483 transitions. [2021-11-19 14:01:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 14:01:45,726 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:45,726 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-19 14:01:45,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 14:01:45,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1481664119, now seen corresponding path program 1 times [2021-11-19 14:01:45,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:45,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130978726] [2021-11-19 14:01:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:45,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:45,870 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-19 14:01:45,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:45,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130978726] [2021-11-19 14:01:45,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130978726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:45,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 14:01:45,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 14:01:45,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778379738] [2021-11-19 14:01:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:45,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 14:01:45,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:45,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 14:01:45,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 14:01:45,873 INFO L87 Difference]: Start difference. First operand 1229 states and 2483 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-19 14:01:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:46,311 INFO L93 Difference]: Finished difference Result 1389 states and 2811 transitions. [2021-11-19 14:01:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 14:01:46,311 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-19 14:01:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:46,321 INFO L225 Difference]: With dead ends: 1389 [2021-11-19 14:01:46,322 INFO L226 Difference]: Without dead ends: 1374 [2021-11-19 14:01:46,322 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-19 14:01:46,323 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:46,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 27 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 14:01:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2021-11-19 14:01:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2021-11-19 14:01:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1361 states have (on average 2.0418809698750917) internal successors, (2779), 1373 states have internal predecessors, (2779), 0 states have call successors, (0), 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-19 14:01:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2779 transitions. [2021-11-19 14:01:46,382 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2779 transitions. Word has length 27 [2021-11-19 14:01:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:46,382 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 2779 transitions. [2021-11-19 14:01:46,382 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-19 14:01:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2779 transitions. [2021-11-19 14:01:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 14:01:46,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:46,384 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-19 14:01:46,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-19 14:01:46,385 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1167859103, now seen corresponding path program 1 times [2021-11-19 14:01:46,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:46,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780166044] [2021-11-19 14:01:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:46,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:46,524 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-19 14:01:46,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:46,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780166044] [2021-11-19 14:01:46,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780166044] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:46,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846824486] [2021-11-19 14:01:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:46,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:46,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:46,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 14:01:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:46,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 14:01:46,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:46,647 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-19 14:01:46,737 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-19 14:01:46,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:46,792 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-19 14:01:46,796 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 25 treesize of output 18 [2021-11-19 14:01:46,840 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-19 14:01:46,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846824486] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:46,841 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:01:46,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 9 [2021-11-19 14:01:46,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944515061] [2021-11-19 14:01:46,841 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:46,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 14:01:46,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 14:01:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-19 14:01:46,843 INFO L87 Difference]: Start difference. First operand 1374 states and 2779 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:47,106 INFO L93 Difference]: Finished difference Result 2455 states and 4858 transitions. [2021-11-19 14:01:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 14:01:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-19 14:01:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:47,124 INFO L225 Difference]: With dead ends: 2455 [2021-11-19 14:01:47,124 INFO L226 Difference]: Without dead ends: 2455 [2021-11-19 14:01:47,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-19 14:01:47,125 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 142 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:47,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 260 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 14:01:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2021-11-19 14:01:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 1414. [2021-11-19 14:01:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1401 states have (on average 2.0221270521056387) internal successors, (2833), 1413 states have internal predecessors, (2833), 0 states have call successors, (0), 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-19 14:01:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2833 transitions. [2021-11-19 14:01:47,203 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2833 transitions. Word has length 31 [2021-11-19 14:01:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:47,204 INFO L470 AbstractCegarLoop]: Abstraction has 1414 states and 2833 transitions. [2021-11-19 14:01:47,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:47,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2833 transitions. [2021-11-19 14:01:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 14:01:47,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:47,209 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-19 14:01:47,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:47,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:47,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1954026677, now seen corresponding path program 2 times [2021-11-19 14:01:47,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:47,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566823013] [2021-11-19 14:01:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:47,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:47,542 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-19 14:01:47,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:47,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566823013] [2021-11-19 14:01:47,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566823013] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:47,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063258113] [2021-11-19 14:01:47,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:01:47,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:47,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:47,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:47,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 14:01:47,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:01:47,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:47,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 14:01:47,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:47,650 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-19 14:01:47,727 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-19 14:01:47,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:47,805 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 18 treesize of output 16 [2021-11-19 14:01:47,808 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 19 treesize of output 15 [2021-11-19 14:01:47,844 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-19 14:01:47,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063258113] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:47,844 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:01:47,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2021-11-19 14:01:47,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500932961] [2021-11-19 14:01:47,845 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:47,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 14:01:47,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 14:01:47,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-19 14:01:47,846 INFO L87 Difference]: Start difference. First operand 1414 states and 2833 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:48,106 INFO L93 Difference]: Finished difference Result 2481 states and 4897 transitions. [2021-11-19 14:01:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:01:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-19 14:01:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:48,123 INFO L225 Difference]: With dead ends: 2481 [2021-11-19 14:01:48,124 INFO L226 Difference]: Without dead ends: 2481 [2021-11-19 14:01:48,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:01:48,125 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 156 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:48,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 260 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 14:01:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-11-19 14:01:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 1401. [2021-11-19 14:01:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1388 states have (on average 2.0223342939481266) internal successors, (2807), 1400 states have internal predecessors, (2807), 0 states have call successors, (0), 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-19 14:01:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2807 transitions. [2021-11-19 14:01:48,204 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2807 transitions. Word has length 31 [2021-11-19 14:01:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:48,205 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 2807 transitions. [2021-11-19 14:01:48,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2807 transitions. [2021-11-19 14:01:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 14:01:48,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:48,206 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-19 14:01:48,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:48,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-19 14:01:48,420 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:48,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1489257133, now seen corresponding path program 3 times [2021-11-19 14:01:48,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:48,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705627470] [2021-11-19 14:01:48,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:48,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:48,517 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-19 14:01:48,517 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:48,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705627470] [2021-11-19 14:01:48,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705627470] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:48,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105348446] [2021-11-19 14:01:48,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:01:48,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:48,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:48,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:48,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 14:01:48,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:01:48,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:48,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-19 14:01:48,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:48,702 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-19 14:01:48,814 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-19 14:01:48,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:48,872 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-19 14:01:48,883 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 25 treesize of output 18 [2021-11-19 14:01:48,916 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-19 14:01:48,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105348446] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 14:01:48,917 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 14:01:48,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 12 [2021-11-19 14:01:48,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917857301] [2021-11-19 14:01:48,917 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 14:01:48,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 14:01:48,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 14:01:48,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-19 14:01:48,920 INFO L87 Difference]: Start difference. First operand 1401 states and 2807 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:49,238 INFO L93 Difference]: Finished difference Result 3491 states and 6935 transitions. [2021-11-19 14:01:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 14:01:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-19 14:01:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:49,261 INFO L225 Difference]: With dead ends: 3491 [2021-11-19 14:01:49,261 INFO L226 Difference]: Without dead ends: 3491 [2021-11-19 14:01:49,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-11-19 14:01:49,262 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 274 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:49,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 230 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 14:01:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2021-11-19 14:01:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 1443. [2021-11-19 14:01:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1430 states have (on average 2.021678321678322) internal successors, (2891), 1442 states have internal predecessors, (2891), 0 states have call successors, (0), 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-19 14:01:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2891 transitions. [2021-11-19 14:01:49,349 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2891 transitions. Word has length 31 [2021-11-19 14:01:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:49,349 INFO L470 AbstractCegarLoop]: Abstraction has 1443 states and 2891 transitions. [2021-11-19 14:01:49,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 14:01:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2891 transitions. [2021-11-19 14:01:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:01:49,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:49,352 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-19 14:01:49,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:49,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-19 14:01:49,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:49,568 INFO L85 PathProgramCache]: Analyzing trace with hash 347685300, now seen corresponding path program 1 times [2021-11-19 14:01:49,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:49,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759641694] [2021-11-19 14:01:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:49,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:49,965 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-19 14:01:49,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:49,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759641694] [2021-11-19 14:01:49,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759641694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:49,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961418567] [2021-11-19 14:01:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:49,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:49,968 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:49,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 14:01:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:50,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-19 14:01:50,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:50,525 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-19 14:01:50,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,577 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-19 14:01:50,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,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-19 14:01:50,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,736 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-19 14:01:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:50,877 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-19 14:01:50,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 68 [2021-11-19 14:01:50,926 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-19 14:01:50,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:01:51,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:51,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:01:52,198 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-19 14:01:52,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961418567] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:01:52,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649878811] [2021-11-19 14:01:52,199 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-19 14:01:52,200 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:01:52,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-19 14:01:52,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35939807] [2021-11-19 14:01:52,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:01:52,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-19 14:01:52,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:01:52,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-19 14:01:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2021-11-19 14:01:52,202 INFO L87 Difference]: Start difference. First operand 1443 states and 2891 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:01:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:01:57,086 INFO L93 Difference]: Finished difference Result 6567 states and 13056 transitions. [2021-11-19 14:01:57,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-19 14:01:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:01:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:01:57,129 INFO L225 Difference]: With dead ends: 6567 [2021-11-19 14:01:57,129 INFO L226 Difference]: Without dead ends: 6564 [2021-11-19 14:01:57,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=682, Invalid=2978, Unknown=0, NotChecked=0, Total=3660 [2021-11-19 14:01:57,132 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 937 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 5290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1915 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-19 14:01:57,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [937 Valid, 331 Invalid, 5290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 3204 Invalid, 0 Unknown, 1915 Unchecked, 2.8s Time] [2021-11-19 14:01:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-11-19 14:01:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 2501. [2021-11-19 14:01:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2488 states have (on average 2.1008842443729905) internal successors, (5227), 2500 states have internal predecessors, (5227), 0 states have call successors, (0), 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-19 14:01:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 5227 transitions. [2021-11-19 14:01:57,259 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 5227 transitions. Word has length 45 [2021-11-19 14:01:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:01:57,260 INFO L470 AbstractCegarLoop]: Abstraction has 2501 states and 5227 transitions. [2021-11-19 14:01:57,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:01:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 5227 transitions. [2021-11-19 14:01:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:01:57,263 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:01:57,263 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-19 14:01:57,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 14:01:57,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 14:01:57,488 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:01:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:01:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 347737380, now seen corresponding path program 2 times [2021-11-19 14:01:57,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:01:57,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141667145] [2021-11-19 14:01:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:01:57,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:01:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:01:57,825 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-19 14:01:57,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:01:57,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141667145] [2021-11-19 14:01:57,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141667145] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:01:57,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679562655] [2021-11-19 14:01:57,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:01:57,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:01:57,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:01:57,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:01:57,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 14:01:57,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:01:57,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:01:57,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-19 14:01:57,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:01:57,984 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-19 14:01:58,145 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:01:58,145 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-19 14:01:58,194 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:01:58,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:58,239 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-19 14:01:58,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:58,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:58,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:01:58,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-19 14:01:58,405 INFO L354 Elim1Store]: treesize reduction 92, result has 22.0 percent of original size [2021-11-19 14:01:58,406 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 50 treesize of output 55 [2021-11-19 14:02:06,558 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-19 14:02:06,558 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-19 14:02:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:02:10,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:13,075 INFO L354 Elim1Store]: treesize reduction 188, result has 16.4 percent of original size [2021-11-19 14:02:13,075 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 56 treesize of output 49 [2021-11-19 14:02:13,078 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 35 [2021-11-19 14:02:13,089 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-19 14:02:13,089 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 42 treesize of output 32 [2021-11-19 14:02:13,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,133 INFO L354 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2021-11-19 14:02:13,134 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-19 14:02:13,141 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 43 treesize of output 37 [2021-11-19 14:02:13,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2021-11-19 14:02:13,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,205 INFO L354 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2021-11-19 14:02:13,205 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-19 14:02:13,210 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 43 treesize of output 37 [2021-11-19 14:02:13,213 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:13,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2021-11-19 14:02:13,626 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 51 treesize of output 49 [2021-11-19 14:02:13,631 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 54 treesize of output 47 [2021-11-19 14:02:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:02:13,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679562655] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:02:13,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:02:13,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 24 [2021-11-19 14:02:13,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224728198] [2021-11-19 14:02:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:02:13,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 14:02:13,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:02:13,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 14:02:13,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=484, Unknown=5, NotChecked=0, Total=600 [2021-11-19 14:02:13,674 INFO L87 Difference]: Start difference. First operand 2501 states and 5227 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-19 14:02:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:22,710 INFO L93 Difference]: Finished difference Result 3940 states and 8177 transitions. [2021-11-19 14:02:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 14:02:22,712 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-19 14:02:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:22,723 INFO L225 Difference]: With dead ends: 3940 [2021-11-19 14:02:22,723 INFO L226 Difference]: Without dead ends: 3940 [2021-11-19 14:02:22,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=158, Invalid=763, Unknown=9, NotChecked=0, Total=930 [2021-11-19 14:02:22,725 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 128 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 656 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:22,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 49 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 410 Invalid, 0 Unknown, 656 Unchecked, 0.5s Time] [2021-11-19 14:02:22,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2021-11-19 14:02:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 2637. [2021-11-19 14:02:22,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2637 states, 2624 states have (on average 2.104801829268293) internal successors, (5523), 2636 states have internal predecessors, (5523), 0 states have call successors, (0), 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-19 14:02:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 5523 transitions. [2021-11-19 14:02:22,812 INFO L78 Accepts]: Start accepts. Automaton has 2637 states and 5523 transitions. Word has length 45 [2021-11-19 14:02:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:22,813 INFO L470 AbstractCegarLoop]: Abstraction has 2637 states and 5523 transitions. [2021-11-19 14:02:22,813 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-19 14:02:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2637 states and 5523 transitions. [2021-11-19 14:02:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:02:22,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:22,816 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-19 14:02:22,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:23,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:23,040 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:02:23,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash 401217030, now seen corresponding path program 3 times [2021-11-19 14:02:23,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:02:23,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212291618] [2021-11-19 14:02:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:23,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:02:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:23,322 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-19 14:02:23,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:02:23,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212291618] [2021-11-19 14:02:23,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212291618] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:02:23,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868135041] [2021-11-19 14:02:23,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:02:23,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:23,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:02:23,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:02:23,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 14:02:23,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:02:23,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:02:23,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-19 14:02:23,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:23,934 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-19 14:02:23,992 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-19 14:02:23,993 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-19 14:02:24,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,023 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-19 14:02:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,070 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:02:24,071 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-11-19 14:02:24,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:24,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:02:24,126 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 3 case distinctions, treesize of input 39 treesize of output 44 [2021-11-19 14:02:24,171 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-19 14:02:24,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:26,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2021-11-19 14:02:26,256 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 14:02:26,257 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-19 14:02:26,260 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 17 treesize of output 15 [2021-11-19 14:02:26,262 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 22 treesize of output 20 [2021-11-19 14:02:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-19 14:02:26,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868135041] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:02:26,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1015837681] [2021-11-19 14:02:26,432 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-19 14:02:26,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:02:26,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-19 14:02:26,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735961483] [2021-11-19 14:02:26,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:02:26,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 14:02:26,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:02:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 14:02:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2021-11-19 14:02:26,436 INFO L87 Difference]: Start difference. First operand 2637 states and 5523 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:28,351 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (- 1))) 28)) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (forall ((|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 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|)) is different from false [2021-11-19 14:02:31,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.offset| 0) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_~#cache~0.offset| .cse0))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< .cse0 (* 28 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2021-11-19 14:02:36,465 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (forall ((|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_~#cache~0.offset| .cse0))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< .cse0 (* 28 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2021-11-19 14:02:37,755 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int) (|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_124|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_~#cache~0.offset| .cse0))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< .cse0 (* 28 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2021-11-19 14:02:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:37,857 INFO L93 Difference]: Finished difference Result 11487 states and 23365 transitions. [2021-11-19 14:02:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-19 14:02:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:37,888 INFO L225 Difference]: With dead ends: 11487 [2021-11-19 14:02:37,888 INFO L226 Difference]: Without dead ends: 11487 [2021-11-19 14:02:37,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 5003 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1979, Invalid=11376, Unknown=5, NotChecked=1160, Total=14520 [2021-11-19 14:02:37,894 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1306 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 5412 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 6720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 5412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 888 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:37,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1306 Valid, 444 Invalid, 6720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 5412 Invalid, 0 Unknown, 888 Unchecked, 3.9s Time] [2021-11-19 14:02:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2021-11-19 14:02:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 3837. [2021-11-19 14:02:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3824 states have (on average 2.146182008368201) internal successors, (8207), 3836 states have internal predecessors, (8207), 0 states have call successors, (0), 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-19 14:02:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 8207 transitions. [2021-11-19 14:02:38,120 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 8207 transitions. Word has length 45 [2021-11-19 14:02:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:38,120 INFO L470 AbstractCegarLoop]: Abstraction has 3837 states and 8207 transitions. [2021-11-19 14:02:38,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 8207 transitions. [2021-11-19 14:02:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:02:38,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:38,125 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-19 14:02:38,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:38,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-19 14:02:38,339 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:02:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2031981188, now seen corresponding path program 1 times [2021-11-19 14:02:38,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:02:38,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331652236] [2021-11-19 14:02:38,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:38,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:02:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:38,528 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-19 14:02:38,528 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:02:38,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331652236] [2021-11-19 14:02:38,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331652236] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:02:38,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796221018] [2021-11-19 14:02:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:38,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:38,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:02:38,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:02:38,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-19 14:02:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:38,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-19 14:02:38,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:38,907 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-19 14:02:38,957 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-19 14:02:38,958 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-19 14:02:39,049 INFO L354 Elim1Store]: treesize reduction 76, result has 22.4 percent of original size [2021-11-19 14:02:39,049 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-19 14:02:39,158 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-19 14:02:39,159 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-19 14:02:39,293 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-19 14:02:39,293 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-19 14:02:39,373 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-19 14:02:39,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:39,517 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 14:02:39,518 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-19 14:02:39,520 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 29 treesize of output 25 [2021-11-19 14:02:39,522 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 32 treesize of output 28 [2021-11-19 14:02:39,742 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-19 14:02:39,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796221018] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:02:39,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [266383966] [2021-11-19 14:02:39,744 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-19 14:02:39,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:02:39,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2021-11-19 14:02:39,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062755713] [2021-11-19 14:02:39,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:02:39,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-19 14:02:39,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:02:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-19 14:02:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-11-19 14:02:39,747 INFO L87 Difference]: Start difference. First operand 3837 states and 8207 transitions. Second operand has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 27 states have internal predecessors, (95), 0 states have call successors, (0), 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-19 14:02:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:47,285 INFO L93 Difference]: Finished difference Result 11972 states and 24652 transitions. [2021-11-19 14:02:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-11-19 14:02:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 27 states have internal predecessors, (95), 0 states have call successors, (0), 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-19 14:02:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:47,321 INFO L225 Difference]: With dead ends: 11972 [2021-11-19 14:02:47,321 INFO L226 Difference]: Without dead ends: 11972 [2021-11-19 14:02:47,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6885 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3316, Invalid=14506, Unknown=0, NotChecked=0, Total=17822 [2021-11-19 14:02:47,328 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 1042 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 4593 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 5464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 4593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:47,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1042 Valid, 498 Invalid, 5464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 4593 Invalid, 0 Unknown, 632 Unchecked, 3.7s Time] [2021-11-19 14:02:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2021-11-19 14:02:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 4382. [2021-11-19 14:02:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4369 states have (on average 2.1329823758297093) internal successors, (9319), 4381 states have internal predecessors, (9319), 0 states have call successors, (0), 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-19 14:02:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 9319 transitions. [2021-11-19 14:02:47,511 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 9319 transitions. Word has length 45 [2021-11-19 14:02:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:47,511 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 9319 transitions. [2021-11-19 14:02:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 27 states have internal predecessors, (95), 0 states have call successors, (0), 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-19 14:02:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 9319 transitions. [2021-11-19 14:02:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:02:47,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:47,516 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-19 14:02:47,555 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:47,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-19 14:02:47,740 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:02:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1918409626, now seen corresponding path program 4 times [2021-11-19 14:02:47,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:02:47,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259437897] [2021-11-19 14:02:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:47,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:02:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:47,989 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-19 14:02:47,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:02:47,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259437897] [2021-11-19 14:02:47,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259437897] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:02:47,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754698405] [2021-11-19 14:02:47,990 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:02:47,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:02:47,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:02:47,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-19 14:02:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:48,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:02:48,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:48,488 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-19 14:02:48,552 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 14:02:48,552 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-19 14:02:48,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,580 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-19 14:02:48,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,625 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:02:48,625 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-11-19 14:02:48,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:48,668 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:02:48,668 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 3 case distinctions, treesize of input 39 treesize of output 44 [2021-11-19 14:02:48,704 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-19 14:02:48,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:48,841 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 14:02:48,841 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-19 14:02:48,844 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-19 14:02:48,853 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-19 14:02:49,084 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-19 14:02:49,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754698405] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:02:49,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [807309659] [2021-11-19 14:02:49,085 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-19 14:02:49,086 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:02:49,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-19 14:02:49,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269219500] [2021-11-19 14:02:49,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:02:49,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 14:02:49,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:02:49,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 14:02:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2021-11-19 14:02:49,088 INFO L87 Difference]: Start difference. First operand 4382 states and 9319 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:02:54,399 INFO L93 Difference]: Finished difference Result 8410 states and 17222 transitions. [2021-11-19 14:02:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-19 14:02:54,399 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:02:54,415 INFO L225 Difference]: With dead ends: 8410 [2021-11-19 14:02:54,415 INFO L226 Difference]: Without dead ends: 8406 [2021-11-19 14:02:54,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2446 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1321, Invalid=5989, Unknown=0, NotChecked=0, Total=7310 [2021-11-19 14:02:54,419 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 937 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 5935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-19 14:02:54,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [937 Valid, 283 Invalid, 5935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 5138 Invalid, 0 Unknown, 435 Unchecked, 3.7s Time] [2021-11-19 14:02:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8406 states. [2021-11-19 14:02:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8406 to 2931. [2021-11-19 14:02:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2918 states have (on average 2.0966415352981493) internal successors, (6118), 2930 states have internal predecessors, (6118), 0 states have call successors, (0), 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-19 14:02:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 6118 transitions. [2021-11-19 14:02:54,563 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 6118 transitions. Word has length 45 [2021-11-19 14:02:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:02:54,563 INFO L470 AbstractCegarLoop]: Abstraction has 2931 states and 6118 transitions. [2021-11-19 14:02:54,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:02:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 6118 transitions. [2021-11-19 14:02:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:02:54,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:02:54,567 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-19 14:02:54,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-19 14:02:54,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:54,792 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:02:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:02:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 713987404, now seen corresponding path program 1 times [2021-11-19 14:02:54,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:02:54,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299845524] [2021-11-19 14:02:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:54,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:02:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:55,495 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-19 14:02:55,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:02:55,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299845524] [2021-11-19 14:02:55,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299845524] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:02:55,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85968190] [2021-11-19 14:02:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:02:55,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:02:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:02:55,497 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:02:55,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-19 14:02:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:02:55,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-19 14:02:55,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:02:55,863 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-19 14:02:55,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:55,915 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-19 14:02:55,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:55,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:55,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:55,984 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-19 14:02:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,055 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-19 14:02:56,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,207 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-19 14:02:56,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,301 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-19 14:02:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,422 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-19 14:02:56,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,555 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-19 14:02:56,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:02:56,789 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:02:56,789 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 28 case distinctions, treesize of input 74 treesize of output 87 [2021-11-19 14:02:56,868 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-19 14:02:56,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:02:59,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:02:59,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:00,362 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-19 14:03:00,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85968190] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:03:00,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220166518] [2021-11-19 14:03:00,364 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-19 14:03:00,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:03:00,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-19 14:03:00,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288800446] [2021-11-19 14:03:00,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:03:00,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 14:03:00,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:03:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 14:03:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2021-11-19 14:03:00,370 INFO L87 Difference]: Start difference. First operand 2931 states and 6118 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-19 14:03:13,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:13,467 INFO L93 Difference]: Finished difference Result 6668 states and 13593 transitions. [2021-11-19 14:03:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-19 14:03:13,468 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-19 14:03:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:13,479 INFO L225 Difference]: With dead ends: 6668 [2021-11-19 14:03:13,479 INFO L226 Difference]: Without dead ends: 6668 [2021-11-19 14:03:13,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=955, Invalid=3875, Unknown=0, NotChecked=0, Total=4830 [2021-11-19 14:03:13,481 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 713 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1318 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:13,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 409 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1520 Invalid, 0 Unknown, 1318 Unchecked, 1.3s Time] [2021-11-19 14:03:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2021-11-19 14:03:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 4287. [2021-11-19 14:03:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 4274 states have (on average 2.1389798783341134) internal successors, (9142), 4286 states have internal predecessors, (9142), 0 states have call successors, (0), 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-19 14:03:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 9142 transitions. [2021-11-19 14:03:13,626 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 9142 transitions. Word has length 45 [2021-11-19 14:03:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:13,626 INFO L470 AbstractCegarLoop]: Abstraction has 4287 states and 9142 transitions. [2021-11-19 14:03:13,627 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-19 14:03:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 9142 transitions. [2021-11-19 14:03:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:03:13,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:13,631 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-19 14:03:13,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:13,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-19 14:03:13,844 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:03:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash 804977796, now seen corresponding path program 2 times [2021-11-19 14:03:13,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:03:13,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071995960] [2021-11-19 14:03:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:03:13,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:03:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:14,750 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-19 14:03:14,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:03:14,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071995960] [2021-11-19 14:03:14,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071995960] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:03:14,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159645639] [2021-11-19 14:03:14,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:03:14,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:03:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:03:14,752 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:03:14,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-19 14:03:14,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:03:14,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:03:14,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:03:14,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:14,888 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-19 14:03:14,932 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-19 14:03:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:14,982 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-19 14:03:15,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,031 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-19 14:03:15,104 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:03:15,104 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-19 14:03:15,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-19 14:03:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,262 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-19 14:03:15,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,347 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-19 14:03:15,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,477 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-19 14:03:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:15,599 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-19 14:03:15,930 INFO L354 Elim1Store]: treesize reduction 732, result has 9.5 percent of original size [2021-11-19 14:03:15,930 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 117 treesize of output 124 [2021-11-19 14:03:20,987 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-19 14:03:20,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:24,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:03:24,443 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 59 [2021-11-19 14:03:24,446 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 64 treesize of output 57 [2021-11-19 14:03:24,496 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-19 14:03:24,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159645639] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:03:24,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:03:24,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 13] total 33 [2021-11-19 14:03:24,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800094198] [2021-11-19 14:03:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:03:24,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:03:24,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:03:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:03:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=920, Unknown=5, NotChecked=0, Total=1122 [2021-11-19 14:03:24,498 INFO L87 Difference]: Start difference. First operand 4287 states and 9142 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:03:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:03:24,555 INFO L93 Difference]: Finished difference Result 4921 states and 10434 transitions. [2021-11-19 14:03:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-19 14:03:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:03:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:03:24,565 INFO L225 Difference]: With dead ends: 4921 [2021-11-19 14:03:24,566 INFO L226 Difference]: Without dead ends: 4921 [2021-11-19 14:03:24,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=197, Invalid=920, Unknown=5, NotChecked=0, Total=1122 [2021-11-19 14:03:24,567 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 14:03:24,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 165 Unchecked, 0.0s Time] [2021-11-19 14:03:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2021-11-19 14:03:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 4340. [2021-11-19 14:03:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 4327 states have (on average 2.137277559510053) internal successors, (9248), 4339 states have internal predecessors, (9248), 0 states have call successors, (0), 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-19 14:03:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 9248 transitions. [2021-11-19 14:03:24,689 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 9248 transitions. Word has length 45 [2021-11-19 14:03:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:03:24,689 INFO L470 AbstractCegarLoop]: Abstraction has 4340 states and 9248 transitions. [2021-11-19 14:03:24,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:03:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 9248 transitions. [2021-11-19 14:03:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:03:24,693 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:03:24,693 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-19 14:03:24,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-19 14:03:24,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-19 14:03:24,920 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:03:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:03:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1837036126, now seen corresponding path program 3 times [2021-11-19 14:03:24,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:03:24,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976707478] [2021-11-19 14:03:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:03:24,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:03:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:03:25,719 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-19 14:03:25,719 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:03:25,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976707478] [2021-11-19 14:03:25,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976707478] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:03:25,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333350195] [2021-11-19 14:03:25,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:03:25,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:03:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:03:25,721 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:03:25,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-19 14:03:26,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:03:26,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:03:26,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-19 14:03:26,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:03:26,202 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-19 14:03:26,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,236 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-19 14:03:26,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,286 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-19 14:03:26,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,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-19 14:03:26,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,474 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-19 14:03:26,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,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-19 14:03:26,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,660 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-19 14:03:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:03:26,775 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-19 14:03:27,081 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-19 14:03:27,082 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-19 14:03:38,329 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-19 14:03:38,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:03:41,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse0 (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse1 (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 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse4 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) is different from false [2021-11-19 14:03:58,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (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|) .cse3 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse6 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) is different from false [2021-11-19 14:03:58,823 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-19 14:03:58,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333350195] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:03:58,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50574728] [2021-11-19 14:03:58,825 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-19 14:03:58,826 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:03:58,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 37 [2021-11-19 14:03:58,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857576456] [2021-11-19 14:03:58,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:03:58,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 14:03:58,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:03:58,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 14:03:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1051, Unknown=9, NotChecked=138, Total=1406 [2021-11-19 14:03:58,828 INFO L87 Difference]: Start difference. First operand 4340 states and 9248 transitions. Second operand has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:04:05,399 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (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|) .cse3 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse6 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|)) is different from false [2021-11-19 14:04:07,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse1 (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (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|) .cse3 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse4 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse5 (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))) is different from false [2021-11-19 14:04:16,019 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse2 (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|) .cse3 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse6 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |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|)) is different from false [2021-11-19 14:04:17,714 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) (= (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) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 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_490| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse1 (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (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|) .cse3 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse4 (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122| Int)) (= (select (select (let ((.cse5 (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|) (+ |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_490| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_490| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_122|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))) is different from false [2021-11-19 14:04:32,676 WARN L227 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:05:26,854 WARN L227 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:05:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:05:34,161 INFO L93 Difference]: Finished difference Result 11719 states and 24674 transitions. [2021-11-19 14:05:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-19 14:05:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:05:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:05:34,180 INFO L225 Difference]: With dead ends: 11719 [2021-11-19 14:05:34,180 INFO L226 Difference]: Without dead ends: 11719 [2021-11-19 14:05:34,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 124.8s TimeCoverageRelationStatistics Valid=567, Invalid=3713, Unknown=34, NotChecked=798, Total=5112 [2021-11-19 14:05:34,183 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 674 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 5892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3335 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:05:34,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [674 Valid, 616 Invalid, 5892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2464 Invalid, 0 Unknown, 3335 Unchecked, 1.9s Time] [2021-11-19 14:05:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11719 states. [2021-11-19 14:05:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11719 to 6703. [2021-11-19 14:05:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6703 states, 6690 states have (on average 2.1614349775784754) internal successors, (14460), 6702 states have internal predecessors, (14460), 0 states have call successors, (0), 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-19 14:05:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 14460 transitions. [2021-11-19 14:05:34,418 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 14460 transitions. Word has length 45 [2021-11-19 14:05:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:05:34,419 INFO L470 AbstractCegarLoop]: Abstraction has 6703 states and 14460 transitions. [2021-11-19 14:05:34,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:05:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 14460 transitions. [2021-11-19 14:05:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:05:34,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:05:34,424 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-19 14:05:34,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-19 14:05:34,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:05:34,640 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:05:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:05:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 175684104, now seen corresponding path program 4 times [2021-11-19 14:05:34,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:05:34,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505512745] [2021-11-19 14:05:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:05:34,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:05:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:05:35,368 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-19 14:05:35,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:05:35,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505512745] [2021-11-19 14:05:35,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505512745] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:05:35,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885409079] [2021-11-19 14:05:35,368 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:05:35,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:05:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:05:35,371 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:05:35,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-19 14:05:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:05:35,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-19 14:05:35,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:05:35,711 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-19 14:05:35,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,787 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-19 14:05:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,892 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-19 14:05:35,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:35,987 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-19 14:05:36,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,110 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-19 14:05:36,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,212 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-19 14:05:36,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,323 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-19 14:05:36,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,440 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-19 14:05:36,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:36,676 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:05:36,677 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 28 case distinctions, treesize of input 74 treesize of output 87 [2021-11-19 14:05:36,761 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-19 14:05:36,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:05:40,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:40,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:05:41,013 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-19 14:05:41,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885409079] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:05:41,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1119373671] [2021-11-19 14:05:41,015 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-19 14:05:41,016 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:05:41,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-19 14:05:41,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494488098] [2021-11-19 14:05:41,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:05:41,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 14:05:41,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:05:41,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 14:05:41,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1247, Unknown=0, NotChecked=0, Total=1482 [2021-11-19 14:05:41,017 INFO L87 Difference]: Start difference. First operand 6703 states and 14460 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-19 14:05:50,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:05:50,440 INFO L93 Difference]: Finished difference Result 11247 states and 23627 transitions. [2021-11-19 14:05:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-19 14:05:50,440 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-19 14:05:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:05:50,457 INFO L225 Difference]: With dead ends: 11247 [2021-11-19 14:05:50,457 INFO L226 Difference]: Without dead ends: 11247 [2021-11-19 14:05:50,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970 [2021-11-19 14:05:50,458 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 748 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 4250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1873 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:05:50,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [748 Valid, 349 Invalid, 4250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2232 Invalid, 0 Unknown, 1873 Unchecked, 2.1s Time] [2021-11-19 14:05:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11247 states. [2021-11-19 14:05:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11247 to 8795. [2021-11-19 14:05:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8795 states, 8782 states have (on average 2.168982008654065) internal successors, (19048), 8794 states have internal predecessors, (19048), 0 states have call successors, (0), 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-19 14:05:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8795 states to 8795 states and 19048 transitions. [2021-11-19 14:05:50,712 INFO L78 Accepts]: Start accepts. Automaton has 8795 states and 19048 transitions. Word has length 45 [2021-11-19 14:05:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:05:50,712 INFO L470 AbstractCegarLoop]: Abstraction has 8795 states and 19048 transitions. [2021-11-19 14:05:50,712 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-19 14:05:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8795 states and 19048 transitions. [2021-11-19 14:05:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:05:50,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:05:50,717 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-19 14:05:50,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-19 14:05:50,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:05:50,932 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:05:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:05:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash 703223778, now seen corresponding path program 5 times [2021-11-19 14:05:50,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:05:50,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823024345] [2021-11-19 14:05:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:05:50,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:05:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:05:51,807 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-19 14:05:51,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:05:51,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823024345] [2021-11-19 14:05:51,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823024345] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:05:51,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217726781] [2021-11-19 14:05:51,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:05:51,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:05:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:05:51,809 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:05:51,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-19 14:05:51,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:05:51,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:05:51,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:05:51,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:05:51,959 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-19 14:05:52,058 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-19 14:05:52,128 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:05:52,128 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-19 14:05:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,212 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-19 14:05:52,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-19 14:05:52,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-19 14:05:52,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,438 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-19 14:05:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,525 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-19 14:05:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,655 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-19 14:05:52,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:05:52,833 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-19 14:05:53,271 INFO L354 Elim1Store]: treesize reduction 732, result has 9.5 percent of original size [2021-11-19 14:05:53,271 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 117 treesize of output 124 [2021-11-19 14:06:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:06:00,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:03,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:06:03,816 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 59 [2021-11-19 14:06:03,828 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 64 treesize of output 57 [2021-11-19 14:06:03,872 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-19 14:06:03,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217726781] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:06:03,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:06:03,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 13] total 33 [2021-11-19 14:06:03,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028160676] [2021-11-19 14:06:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:06:03,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:06:03,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:06:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:06:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=891, Unknown=5, NotChecked=0, Total=1122 [2021-11-19 14:06:03,874 INFO L87 Difference]: Start difference. First operand 8795 states and 19048 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:06:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:06:08,172 INFO L93 Difference]: Finished difference Result 14407 states and 30994 transitions. [2021-11-19 14:06:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 14:06:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:06:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:06:08,213 INFO L225 Difference]: With dead ends: 14407 [2021-11-19 14:06:08,213 INFO L226 Difference]: Without dead ends: 14407 [2021-11-19 14:06:08,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=235, Invalid=1019, Unknown=6, NotChecked=0, Total=1260 [2021-11-19 14:06:08,215 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:06:08,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 47 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 333 Unchecked, 0.2s Time] [2021-11-19 14:06:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2021-11-19 14:06:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 8870. [2021-11-19 14:06:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8857 states have (on average 2.1675510895337022) internal successors, (19198), 8869 states have internal predecessors, (19198), 0 states have call successors, (0), 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-19 14:06:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 19198 transitions. [2021-11-19 14:06:08,538 INFO L78 Accepts]: Start accepts. Automaton has 8870 states and 19198 transitions. Word has length 45 [2021-11-19 14:06:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:06:08,538 INFO L470 AbstractCegarLoop]: Abstraction has 8870 states and 19198 transitions. [2021-11-19 14:06:08,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:06:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 8870 states and 19198 transitions. [2021-11-19 14:06:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:06:08,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:06:08,546 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-19 14:06:08,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-19 14:06:08,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-19 14:06:08,765 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:06:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:06:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1269699290, now seen corresponding path program 6 times [2021-11-19 14:06:08,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:06:08,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562477849] [2021-11-19 14:06:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:06:08,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:06:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:06:09,596 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-19 14:06:09,596 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:06:09,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562477849] [2021-11-19 14:06:09,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562477849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:06:09,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305041101] [2021-11-19 14:06:09,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:06:09,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:06:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:06:09,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:06:09,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-19 14:06:09,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:06:09,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:06:09,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-19 14:06:09,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:06:09,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-19 14:06:10,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,083 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-19 14:06:10,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,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, 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-19 14:06:10,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,191 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-19 14:06:10,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,265 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-19 14:06:10,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,347 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-19 14:06:10,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,456 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-19 14:06:10,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:06:10,591 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-19 14:06:10,895 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-19 14:06:10,896 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-19 14:06:21,033 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-19 14:06:21,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:06:39,920 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-19 14:06:39,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305041101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:06:39,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1304890714] [2021-11-19 14:06:39,921 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-19 14:06:39,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:06:39,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 37 [2021-11-19 14:06:39,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595446993] [2021-11-19 14:06:39,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:06:39,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 14:06:39,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:06:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 14:06:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1157, Unknown=9, NotChecked=0, Total=1406 [2021-11-19 14:06:39,925 INFO L87 Difference]: Start difference. First operand 8870 states and 19198 transitions. Second operand has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:08:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:08:05,377 INFO L93 Difference]: Finished difference Result 16689 states and 35283 transitions. [2021-11-19 14:08:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-19 14:08:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:08:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:08:05,410 INFO L225 Difference]: With dead ends: 16689 [2021-11-19 14:08:05,411 INFO L226 Difference]: Without dead ends: 16689 [2021-11-19 14:08:05,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 83 SyntacticMatches, 16 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3228 ImplicationChecksByTransitivity, 112.0s TimeCoverageRelationStatistics Valid=1721, Invalid=6073, Unknown=38, NotChecked=0, Total=7832 [2021-11-19 14:08:05,412 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 944 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 5339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2989 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:08:05,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [944 Valid, 440 Invalid, 5339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 2114 Invalid, 0 Unknown, 2989 Unchecked, 2.1s Time] [2021-11-19 14:08:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16689 states. [2021-11-19 14:08:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16689 to 12891. [2021-11-19 14:08:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12891 states, 12878 states have (on average 2.183724180773412) internal successors, (28122), 12890 states have internal predecessors, (28122), 0 states have call successors, (0), 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-19 14:08:05,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12891 states to 12891 states and 28122 transitions. [2021-11-19 14:08:05,778 INFO L78 Accepts]: Start accepts. Automaton has 12891 states and 28122 transitions. Word has length 45 [2021-11-19 14:08:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:08:05,778 INFO L470 AbstractCegarLoop]: Abstraction has 12891 states and 28122 transitions. [2021-11-19 14:08:05,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.6486486486486487) internal successors, (98), 38 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:08:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12891 states and 28122 transitions. [2021-11-19 14:08:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:08:05,782 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:08:05,783 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-19 14:08:05,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-19 14:08:05,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-19 14:08:05,990 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:08:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:08:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1714094014, now seen corresponding path program 7 times [2021-11-19 14:08:05,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:08:05,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516838118] [2021-11-19 14:08:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:08:05,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:08:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:08:06,880 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-19 14:08:06,880 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:08:06,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516838118] [2021-11-19 14:08:06,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516838118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:08:06,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616248622] [2021-11-19 14:08:06,881 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:08:06,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:08:06,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:08:06,882 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:08:06,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-19 14:08:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:08:06,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-19 14:08:06,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:08:07,252 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-19 14:08:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,400 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 19 treesize of output 18 [2021-11-19 14:08:07,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,483 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-19 14:08:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,579 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-19 14:08:07,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,692 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-19 14:08:07,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,815 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-19 14:08:07,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:07,948 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-19 14:08:08,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,074 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-19 14:08:08,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:08,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:08,326 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 28 case distinctions, treesize of input 74 treesize of output 87 [2021-11-19 14:08:08,388 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-19 14:08:08,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:08:13,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:13,502 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-19 14:08:13,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616248622] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:08:13,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [946728296] [2021-11-19 14:08:13,503 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-19 14:08:13,504 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:08:13,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-19 14:08:13,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834932510] [2021-11-19 14:08:13,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:08:13,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 14:08:13,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:08:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 14:08:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2021-11-19 14:08:13,505 INFO L87 Difference]: Start difference. First operand 12891 states and 28122 transitions. Second operand has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:08:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:08:25,482 INFO L93 Difference]: Finished difference Result 15130 states and 32346 transitions. [2021-11-19 14:08:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-19 14:08:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:08:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:08:25,510 INFO L225 Difference]: With dead ends: 15130 [2021-11-19 14:08:25,510 INFO L226 Difference]: Without dead ends: 15130 [2021-11-19 14:08:25,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 75 SyntacticMatches, 18 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1213, Invalid=4949, Unknown=0, NotChecked=0, Total=6162 [2021-11-19 14:08:25,511 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 643 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 4760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2141 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:08:25,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 388 Invalid, 4760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2459 Invalid, 0 Unknown, 2141 Unchecked, 2.4s Time] [2021-11-19 14:08:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15130 states. [2021-11-19 14:08:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15130 to 12930. [2021-11-19 14:08:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12930 states, 12917 states have (on average 2.183324301308353) internal successors, (28202), 12929 states have internal predecessors, (28202), 0 states have call successors, (0), 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-19 14:08:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12930 states to 12930 states and 28202 transitions. [2021-11-19 14:08:25,886 INFO L78 Accepts]: Start accepts. Automaton has 12930 states and 28202 transitions. Word has length 45 [2021-11-19 14:08:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:08:25,886 INFO L470 AbstractCegarLoop]: Abstraction has 12930 states and 28202 transitions. [2021-11-19 14:08:25,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:08:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12930 states and 28202 transitions. [2021-11-19 14:08:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:08:25,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:08:25,889 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-19 14:08:25,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-19 14:08:26,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:08:26,090 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:08:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:08:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1934980802, now seen corresponding path program 8 times [2021-11-19 14:08:26,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:08:26,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945256575] [2021-11-19 14:08:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:08:26,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:08:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:08:26,881 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-19 14:08:26,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:08:26,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945256575] [2021-11-19 14:08:26,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945256575] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:08:26,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013446236] [2021-11-19 14:08:26,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:08:26,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:08:26,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:08:26,909 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:08:26,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-19 14:08:27,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:08:27,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:08:27,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:08:27,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:08:27,082 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-19 14:08:27,139 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-19 14:08:27,191 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:08:27,191 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-19 14:08:27,248 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 19 treesize of output 18 [2021-11-19 14:08:27,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,308 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-19 14:08:27,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,376 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-19 14:08:27,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,453 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-19 14:08:27,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,549 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-19 14:08:27,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,680 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-19 14:08:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:27,834 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-19 14:08:28,154 INFO L354 Elim1Store]: treesize reduction 732, result has 9.5 percent of original size [2021-11-19 14:08:28,154 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 117 treesize of output 124 [2021-11-19 14:08:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:08:33,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:08:38,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:08:38,638 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 59 [2021-11-19 14:08:38,640 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 64 treesize of output 57 [2021-11-19 14:08:38,687 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-19 14:08:38,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013446236] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:08:38,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:08:38,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 13] total 33 [2021-11-19 14:08:38,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128393453] [2021-11-19 14:08:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:08:38,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:08:38,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:08:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:08:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=914, Unknown=3, NotChecked=0, Total=1122 [2021-11-19 14:08:38,689 INFO L87 Difference]: Start difference. First operand 12930 states and 28202 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:08:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:08:40,193 INFO L93 Difference]: Finished difference Result 18439 states and 40116 transitions. [2021-11-19 14:08:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-19 14:08:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:08:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:08:40,232 INFO L225 Difference]: With dead ends: 18439 [2021-11-19 14:08:40,232 INFO L226 Difference]: Without dead ends: 18439 [2021-11-19 14:08:40,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=209, Invalid=978, Unknown=3, NotChecked=0, Total=1190 [2021-11-19 14:08:40,233 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 43 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:08:40,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 41 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 438 Unchecked, 0.1s Time] [2021-11-19 14:08:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18439 states. [2021-11-19 14:08:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18439 to 13022. [2021-11-19 14:08:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13022 states, 13009 states have (on average 2.182027826889077) internal successors, (28386), 13021 states have internal predecessors, (28386), 0 states have call successors, (0), 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-19 14:08:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13022 states to 13022 states and 28386 transitions. [2021-11-19 14:08:40,636 INFO L78 Accepts]: Start accepts. Automaton has 13022 states and 28386 transitions. Word has length 45 [2021-11-19 14:08:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:08:40,636 INFO L470 AbstractCegarLoop]: Abstraction has 13022 states and 28386 transitions. [2021-11-19 14:08:40,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:08:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13022 states and 28386 transitions. [2021-11-19 14:08:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:08:40,639 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:08:40,640 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-19 14:08:40,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-19 14:08:40,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-19 14:08:40,844 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:08:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:08:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -657698230, now seen corresponding path program 9 times [2021-11-19 14:08:40,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:08:40,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891598739] [2021-11-19 14:08:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:08:40,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:08:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:08:41,635 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-19 14:08:41,635 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:08:41,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891598739] [2021-11-19 14:08:41,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891598739] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:08:41,636 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334601173] [2021-11-19 14:08:41,636 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:08:41,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:08:41,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:08:41,638 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:08:41,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-19 14:08:41,824 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:08:41,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:08:41,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-19 14:08:41,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:08:42,015 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-19 14:08:42,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,107 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 19 treesize of output 18 [2021-11-19 14:08:42,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,153 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,153 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 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-19 14:08:42,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,215 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,215 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 3 case distinctions, treesize of input 37 treesize of output 42 [2021-11-19 14:08:42,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,285 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,285 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 6 case distinctions, treesize of input 46 treesize of output 54 [2021-11-19 14:08:42,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,371 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,371 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 10 case distinctions, treesize of input 55 treesize of output 66 [2021-11-19 14:08:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,470 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,471 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 15 case distinctions, treesize of input 64 treesize of output 78 [2021-11-19 14:08:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:08:42,580 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:08:42,580 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 21 case distinctions, treesize of input 73 treesize of output 90 [2021-11-19 14:08:42,871 INFO L354 Elim1Store]: treesize reduction 879, result has 8.3 percent of original size [2021-11-19 14:08:42,872 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-19 14:08:49,023 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-19 14:08:49,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:08:55,560 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse6 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 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| 1) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= 0 (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0))) is different from false [2021-11-19 14:09:27,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 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| 2) 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse17 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0))))) is different from false [2021-11-19 14:09:28,003 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-19 14:09:28,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334601173] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:09:28,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66144732] [2021-11-19 14:09:28,004 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-19 14:09:28,005 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:09:28,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 38 [2021-11-19 14:09:28,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876570993] [2021-11-19 14:09:28,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:09:28,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 14:09:28,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:09:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 14:09:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1134, Unknown=4, NotChecked=142, Total=1482 [2021-11-19 14:09:28,007 INFO L87 Difference]: Start difference. First operand 13022 states and 28386 transitions. Second operand has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:10:00,217 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 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| 2) 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse17 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0)))))) is different from false [2021-11-19 14:10:02,323 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (- 1))) 28)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse6 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 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| 1) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= 0 (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 14:10:37,671 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 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| 2) 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse17 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse19 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse17)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0)))))) is different from false [2021-11-19 14:10:40,016 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (- 1))) 28)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse5 (let ((.cse6 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 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| 1) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= 0 (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse13 (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)))) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse22 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse20 (let ((.cse21 (let ((.cse23 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse26 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse25 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse24 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse23 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22 0))))) (store .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse20 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse22)) 0))) is different from false [2021-11-19 14:11:13,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ |c_~#cache~0.offset| .cse0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 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| 2) 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse23 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse21 (let ((.cse22 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse23 0))))) (store .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse23)) 0))))) (< .cse0 (* 28 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2021-11-19 14:11:45,243 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ |c_~#cache~0.offset| .cse0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 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| 2) 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 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 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (let ((.cse11 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse19 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse23 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse21 (let ((.cse22 (let ((.cse24 (let ((.cse25 (let ((.cse26 (let ((.cse27 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 0)))) (store .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse27 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse26 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| 1) 0))))) (store .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse25 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse24 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0))))) (store .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse23 0))))) (store .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select .cse21 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_496| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_134|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse23)) 0))))) (< .cse0 (* 28 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2021-11-19 14:11:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:11:45,404 INFO L93 Difference]: Finished difference Result 25600 states and 55483 transitions. [2021-11-19 14:11:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-19 14:11:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:11:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:11:45,513 INFO L225 Difference]: With dead ends: 25600 [2021-11-19 14:11:45,513 INFO L226 Difference]: Without dead ends: 25600 [2021-11-19 14:11:45,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 181.1s TimeCoverageRelationStatistics Valid=398, Invalid=2073, Unknown=11, NotChecked=824, Total=3306 [2021-11-19 14:11:45,515 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 532 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1960 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 14:11:45,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 626 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 773 Invalid, 0 Unknown, 1960 Unchecked, 0.6s Time] [2021-11-19 14:11:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25600 states. [2021-11-19 14:11:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25600 to 15783. [2021-11-19 14:11:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15783 states, 15770 states have (on average 2.1877615726062145) internal successors, (34501), 15782 states have internal predecessors, (34501), 0 states have call successors, (0), 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-19 14:11:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 34501 transitions. [2021-11-19 14:11:46,109 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 34501 transitions. Word has length 45 [2021-11-19 14:11:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:11:46,109 INFO L470 AbstractCegarLoop]: Abstraction has 15783 states and 34501 transitions. [2021-11-19 14:11:46,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.5789473684210527) internal successors, (98), 39 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:11:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 34501 transitions. [2021-11-19 14:11:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:11:46,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:11:46,113 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-19 14:11:46,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-19 14:11:46,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-19 14:11:46,314 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:11:46,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:11:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1267816736, now seen corresponding path program 10 times [2021-11-19 14:11:46,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:11:46,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284402215] [2021-11-19 14:11:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:11:46,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:11:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:11:47,118 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-19 14:11:47,118 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:11:47,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284402215] [2021-11-19 14:11:47,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284402215] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:11:47,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671945293] [2021-11-19 14:11:47,119 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:11:47,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:11:47,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:11:47,120 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:11:47,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-19 14:11:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:11:47,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-19 14:11:47,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:11:47,463 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-19 14:11:47,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,570 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 19 treesize of output 18 [2021-11-19 14:11:47,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,674 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-19 14:11:47,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,744 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-19 14:11:47,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,830 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-19 14:11:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:47,933 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-19 14:11:48,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,046 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-19 14:11:48,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,178 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-19 14:11:48,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:11:48,400 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:11:48,400 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 28 case distinctions, treesize of input 74 treesize of output 87 [2021-11-19 14:11:48,462 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-19 14:11:48,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:11:56,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,596 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:56,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:11:57,159 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-19 14:11:57,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671945293] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:11:57,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2112021426] [2021-11-19 14:11:57,160 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-19 14:11:57,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:11:57,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-19 14:11:57,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925136686] [2021-11-19 14:11:57,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:11:57,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 14:11:57,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:11:57,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 14:11:57,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2021-11-19 14:11:57,163 INFO L87 Difference]: Start difference. First operand 15783 states and 34501 transitions. Second operand has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:12:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:12,795 INFO L93 Difference]: Finished difference Result 17193 states and 37011 transitions. [2021-11-19 14:12:12,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-19 14:12:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:12:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:12,823 INFO L225 Difference]: With dead ends: 17193 [2021-11-19 14:12:12,823 INFO L226 Difference]: Without dead ends: 17193 [2021-11-19 14:12:12,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=1090, Invalid=4460, Unknown=0, NotChecked=0, Total=5550 [2021-11-19 14:12:12,825 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 643 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1106 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:12,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 312 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1332 Invalid, 0 Unknown, 1106 Unchecked, 1.1s Time] [2021-11-19 14:12:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2021-11-19 14:12:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 15791. [2021-11-19 14:12:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15791 states, 15778 states have (on average 2.1876663708961845) internal successors, (34517), 15790 states have internal predecessors, (34517), 0 states have call successors, (0), 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-19 14:12:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15791 states to 15791 states and 34517 transitions. [2021-11-19 14:12:13,231 INFO L78 Accepts]: Start accepts. Automaton has 15791 states and 34517 transitions. Word has length 45 [2021-11-19 14:12:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:13,231 INFO L470 AbstractCegarLoop]: Abstraction has 15791 states and 34517 transitions. [2021-11-19 14:12:13,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 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-19 14:12:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15791 states and 34517 transitions. [2021-11-19 14:12:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:12:13,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:13,234 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-19 14:12:13,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:13,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-19 14:12:13,435 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:12:13,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1141583186, now seen corresponding path program 11 times [2021-11-19 14:12:13,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:12:13,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122923388] [2021-11-19 14:12:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:12:13,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:12:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:12:14,150 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-19 14:12:14,150 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:12:14,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122923388] [2021-11-19 14:12:14,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122923388] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:12:14,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511864913] [2021-11-19 14:12:14,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:12:14,151 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:12:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:12:14,156 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:12:14,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-19 14:12:14,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:12:14,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:12:14,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:12:14,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:14,317 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-19 14:12:14,376 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-19 14:12:14,442 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:12:14,442 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-19 14:12:14,508 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 19 treesize of output 18 [2021-11-19 14:12:14,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,567 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-19 14:12:14,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,679 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-19 14:12:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,775 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-19 14:12:14,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:14,896 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-19 14:12:15,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:15,029 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-19 14:12:15,266 INFO L354 Elim1Store]: treesize reduction 597, result has 10.2 percent of original size [2021-11-19 14:12:15,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 108 treesize of output 112 [2021-11-19 14:12:21,849 INFO L354 Elim1Store]: treesize reduction 440, result has 13.4 percent of original size [2021-11-19 14:12:21,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 105 [2021-11-19 14:12:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:12:25,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:12:29,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,225 INFO L354 Elim1Store]: treesize reduction 915, result has 7.2 percent of original size [2021-11-19 14:12:29,226 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 218 treesize of output 85 [2021-11-19 14:12:29,233 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:12:29,233 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 67 [2021-11-19 14:12:29,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,240 INFO L354 Elim1Store]: treesize reduction 118, result has 0.8 percent of original size [2021-11-19 14:12:29,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 50 [2021-11-19 14:12:29,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,383 INFO L354 Elim1Store]: treesize reduction 673, result has 11.1 percent of original size [2021-11-19 14:12:29,384 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 218 treesize of output 98 [2021-11-19 14:12:29,393 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:12:29,393 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 86 treesize of output 78 [2021-11-19 14:12:29,396 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,412 INFO L354 Elim1Store]: treesize reduction 129, result has 0.8 percent of original size [2021-11-19 14:12:29,412 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 69 treesize of output 38 [2021-11-19 14:12:29,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,552 INFO L354 Elim1Store]: treesize reduction 696, result has 8.1 percent of original size [2021-11-19 14:12:29,553 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 216 treesize of output 73 [2021-11-19 14:12:29,562 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:12:29,563 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 61 treesize of output 57 [2021-11-19 14:12:29,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:12:29,591 INFO L354 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-11-19 14:12:29,591 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 48 treesize of output 28 [2021-11-19 14:12:29,764 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 51 treesize of output 49 [2021-11-19 14:12:29,767 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 54 treesize of output 47 [2021-11-19 14:12:29,818 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-19 14:12:29,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511864913] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:12:29,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:12:29,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 13] total 32 [2021-11-19 14:12:29,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303776618] [2021-11-19 14:12:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:12:29,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 14:12:29,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:12:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 14:12:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=873, Unknown=5, NotChecked=0, Total=1056 [2021-11-19 14:12:29,821 INFO L87 Difference]: Start difference. First operand 15791 states and 34517 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:12:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:12:37,368 INFO L93 Difference]: Finished difference Result 24675 states and 53563 transitions. [2021-11-19 14:12:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-19 14:12:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:12:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:12:37,415 INFO L225 Difference]: With dead ends: 24675 [2021-11-19 14:12:37,415 INFO L226 Difference]: Without dead ends: 24675 [2021-11-19 14:12:37,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=188, Invalid=995, Unknown=7, NotChecked=0, Total=1190 [2021-11-19 14:12:37,416 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 580 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:12:37,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 49 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 580 Unchecked, 0.4s Time] [2021-11-19 14:12:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24675 states. [2021-11-19 14:12:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24675 to 15882. [2021-11-19 14:12:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15882 states, 15869 states have (on average 2.186590207322453) internal successors, (34699), 15881 states have internal predecessors, (34699), 0 states have call successors, (0), 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-19 14:12:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15882 states to 15882 states and 34699 transitions. [2021-11-19 14:12:37,966 INFO L78 Accepts]: Start accepts. Automaton has 15882 states and 34699 transitions. Word has length 45 [2021-11-19 14:12:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:12:37,966 INFO L470 AbstractCegarLoop]: Abstraction has 15882 states and 34699 transitions. [2021-11-19 14:12:37,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 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-19 14:12:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15882 states and 34699 transitions. [2021-11-19 14:12:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:12:37,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:12:37,969 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-19 14:12:37,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-19 14:12:38,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-19 14:12:38,170 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:12:38,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:12:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -915774594, now seen corresponding path program 12 times [2021-11-19 14:12:38,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:12:38,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247831616] [2021-11-19 14:12:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:12:38,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:12:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:12:38,820 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-19 14:12:38,820 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:12:38,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247831616] [2021-11-19 14:12:38,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247831616] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:12:38,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031407308] [2021-11-19 14:12:38,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:12:38,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:12:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:12:38,823 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:12:38,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-19 14:12:39,050 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:12:39,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:12:39,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-19 14:12:39,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:12:39,322 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-19 14:12:39,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,418 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 19 treesize of output 18 [2021-11-19 14:12:39,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,475 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-19 14:12:39,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,538 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-19 14:12:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,603 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-19 14:12:39,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,696 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-19 14:12:39,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,794 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-19 14:12:39,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:12:39,903 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-19 14:12:40,208 INFO L354 Elim1Store]: treesize reduction 783, result has 9.3 percent of original size [2021-11-19 14:12:40,208 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-19 14:12:46,304 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-19 14:12:46,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:13:10,813 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-19 14:13:10,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031407308] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:13:10,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [393425611] [2021-11-19 14:13:10,815 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-19 14:13:10,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:13:10,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 36 [2021-11-19 14:13:10,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121830640] [2021-11-19 14:13:10,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:13:10,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-19 14:13:10,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:13:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-19 14:13:10,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1098, Unknown=6, NotChecked=0, Total=1332 [2021-11-19 14:13:10,817 INFO L87 Difference]: Start difference. First operand 15882 states and 34699 transitions. Second operand has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:13:54,068 WARN L227 SmtUtils]: Spent 12.49s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:14:08,049 WARN L227 SmtUtils]: Spent 10.72s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-19 14:14:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:14:18,875 INFO L93 Difference]: Finished difference Result 22060 states and 47237 transitions. [2021-11-19 14:14:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-19 14:14:18,876 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:14:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:14:18,915 INFO L225 Difference]: With dead ends: 22060 [2021-11-19 14:14:18,915 INFO L226 Difference]: Without dead ends: 22060 [2021-11-19 14:14:18,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2742 ImplicationChecksByTransitivity, 96.3s TimeCoverageRelationStatistics Valid=2128, Invalid=6043, Unknown=19, NotChecked=0, Total=8190 [2021-11-19 14:14:18,917 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 860 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 4381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2389 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-19 14:14:18,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 470 Invalid, 4381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1739 Invalid, 0 Unknown, 2389 Unchecked, 1.9s Time] [2021-11-19 14:14:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22060 states. [2021-11-19 14:14:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22060 to 18793. [2021-11-19 14:14:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18793 states, 18780 states have (on average 2.191160809371672) internal successors, (41150), 18792 states have internal predecessors, (41150), 0 states have call successors, (0), 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-19 14:14:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18793 states to 18793 states and 41150 transitions. [2021-11-19 14:14:19,433 INFO L78 Accepts]: Start accepts. Automaton has 18793 states and 41150 transitions. Word has length 45 [2021-11-19 14:14:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:14:19,433 INFO L470 AbstractCegarLoop]: Abstraction has 18793 states and 41150 transitions. [2021-11-19 14:14:19,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7222222222222223) internal successors, (98), 37 states have internal predecessors, (98), 0 states have call successors, (0), 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-19 14:14:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18793 states and 41150 transitions. [2021-11-19 14:14:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:14:19,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:14:19,437 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-19 14:14:19,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-19 14:14:19,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-19 14:14:19,640 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:14:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:14:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2116125940, now seen corresponding path program 13 times [2021-11-19 14:14:19,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:14:19,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948689314] [2021-11-19 14:14:19,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:19,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:14:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:20,411 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-19 14:14:20,412 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:14:20,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948689314] [2021-11-19 14:14:20,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948689314] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:20,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916136912] [2021-11-19 14:14:20,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:14:20,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:14:20,413 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:14:20,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-19 14:14:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:20,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-19 14:14:20,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:14:21,036 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-19 14:14:21,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,124 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-19 14:14:21,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,197 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-19 14:14:21,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,270 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-19 14:14:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,353 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-19 14:14:21,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,450 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-19 14:14:21,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,571 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-19 14:14:21,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,713 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-19 14:14:21,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:21,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:14:21,934 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 28 case distinctions, treesize of input 74 treesize of output 87 [2021-11-19 14:14:21,999 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-19 14:14:21,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:14:24,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:24,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:25,489 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-19 14:14:25,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916136912] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:14:25,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585878984] [2021-11-19 14:14:25,490 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-19 14:14:25,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:14:25,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-19 14:14:25,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271961504] [2021-11-19 14:14:25,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:14:25,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 14:14:25,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:14:25,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 14:14:25,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1195, Unknown=0, NotChecked=0, Total=1482 [2021-11-19 14:14:25,493 INFO L87 Difference]: Start difference. First operand 18793 states and 41150 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-19 14:14:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:14:33,872 INFO L93 Difference]: Finished difference Result 23130 states and 49885 transitions. [2021-11-19 14:14:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-19 14:14:33,873 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-19 14:14:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:14:33,915 INFO L225 Difference]: With dead ends: 23130 [2021-11-19 14:14:33,915 INFO L226 Difference]: Without dead ends: 23130 [2021-11-19 14:14:33,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1164, Invalid=4238, Unknown=0, NotChecked=0, Total=5402 [2021-11-19 14:14:33,916 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 781 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1128 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:14:33,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 333 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2527 Invalid, 0 Unknown, 1128 Unchecked, 2.4s Time] [2021-11-19 14:14:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2021-11-19 14:14:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 19156. [2021-11-19 14:14:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19156 states, 19143 states have (on average 2.189886642636995) internal successors, (41921), 19155 states have internal predecessors, (41921), 0 states have call successors, (0), 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-19 14:14:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 41921 transitions. [2021-11-19 14:14:34,526 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 41921 transitions. Word has length 45 [2021-11-19 14:14:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:14:34,526 INFO L470 AbstractCegarLoop]: Abstraction has 19156 states and 41921 transitions. [2021-11-19 14:14:34,526 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-19 14:14:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 41921 transitions. [2021-11-19 14:14:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:14:34,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:14:34,529 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1] [2021-11-19 14:14:34,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-19 14:14:34,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-19 14:14:34,730 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:14:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:14:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 696199223, now seen corresponding path program 1 times [2021-11-19 14:14:34,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:14:34,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50719144] [2021-11-19 14:14:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:34,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:14:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:34,972 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:14:34,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50719144] [2021-11-19 14:14:34,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50719144] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:34,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126844186] [2021-11-19 14:14:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:34,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:14:34,974 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:14:34,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-19 14:14:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:35,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-19 14:14:35,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:14:35,456 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-19 14:14:35,506 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-11-19 14:14:35,506 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-19 14:14:35,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,593 INFO L354 Elim1Store]: treesize reduction 49, result has 19.7 percent of original size [2021-11-19 14:14:35,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 44 [2021-11-19 14:14:35,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,686 INFO L354 Elim1Store]: treesize reduction 64, result has 15.8 percent of original size [2021-11-19 14:14:35,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 56 [2021-11-19 14:14:35,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:35,789 INFO L354 Elim1Store]: treesize reduction 79, result has 13.2 percent of original size [2021-11-19 14:14:35,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 68 [2021-11-19 14:14:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:35,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:14:36,015 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 14:14:36,016 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-19 14:14:36,023 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:14:36,023 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-19 14:14:36,030 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:14:36,030 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-19 14:14:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:36,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126844186] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:14:36,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1771017964] [2021-11-19 14:14:36,335 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-19 14:14:36,337 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:14:36,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-19 14:14:36,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309800079] [2021-11-19 14:14:36,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:14:36,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 14:14:36,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:14:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 14:14:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2021-11-19 14:14:36,339 INFO L87 Difference]: Start difference. First operand 19156 states and 41921 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:14:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:14:41,308 INFO L93 Difference]: Finished difference Result 29498 states and 64201 transitions. [2021-11-19 14:14:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-19 14:14:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:14:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:14:41,424 INFO L225 Difference]: With dead ends: 29498 [2021-11-19 14:14:41,424 INFO L226 Difference]: Without dead ends: 29494 [2021-11-19 14:14:41,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1040, Invalid=3516, Unknown=0, NotChecked=0, Total=4556 [2021-11-19 14:14:41,425 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1170 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 3214 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 4615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1203 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-19 14:14:41,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1170 Valid, 227 Invalid, 4615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3214 Invalid, 0 Unknown, 1203 Unchecked, 3.2s Time] [2021-11-19 14:14:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29494 states. [2021-11-19 14:14:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29494 to 20514. [2021-11-19 14:14:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20514 states, 20501 states have (on average 2.190868738110336) internal successors, (44915), 20513 states have internal predecessors, (44915), 0 states have call successors, (0), 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-19 14:14:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20514 states to 20514 states and 44915 transitions. [2021-11-19 14:14:42,018 INFO L78 Accepts]: Start accepts. Automaton has 20514 states and 44915 transitions. Word has length 45 [2021-11-19 14:14:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:14:42,018 INFO L470 AbstractCegarLoop]: Abstraction has 20514 states and 44915 transitions. [2021-11-19 14:14:42,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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-19 14:14:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20514 states and 44915 transitions. [2021-11-19 14:14:42,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:14:42,021 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:14:42,021 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1] [2021-11-19 14:14:42,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-19 14:14:42,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:42,222 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:14:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:14:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 830728693, now seen corresponding path program 2 times [2021-11-19 14:14:42,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:14:42,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193229039] [2021-11-19 14:14:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:42,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:14:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:42,504 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:14:42,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193229039] [2021-11-19 14:14:42,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193229039] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:42,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893377219] [2021-11-19 14:14:42,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:14:42,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:42,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:14:42,507 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:14:42,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-19 14:14:42,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 14:14:42,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:14:42,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-19 14:14:42,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:14:42,676 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-19 14:14:42,738 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-19 14:14:42,738 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-19 14:14:42,874 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-19 14:14:42,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:42,938 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-19 14:14:43,057 INFO L354 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2021-11-19 14:14:43,057 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 41 treesize of output 43 [2021-11-19 14:14:43,178 INFO L354 Elim1Store]: treesize reduction 94, result has 20.3 percent of original size [2021-11-19 14:14:43,178 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 50 treesize of output 55 [2021-11-19 14:14:43,324 INFO L354 Elim1Store]: treesize reduction 152, result has 17.8 percent of original size [2021-11-19 14:14:43,324 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 59 treesize of output 67 [2021-11-19 14:14:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:14:43,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:14:43,671 INFO L354 Elim1Store]: treesize reduction 85, result has 24.1 percent of original size [2021-11-19 14:14:43,672 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 48 treesize of output 41 [2021-11-19 14:14:43,679 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:14:43,679 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-19 14:14:43,690 INFO L354 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2021-11-19 14:14:43,690 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 42 treesize of output 38 [2021-11-19 14:14:43,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:43,731 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-19 14:14:43,732 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 46 treesize of output 39 [2021-11-19 14:14:43,735 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-19 14:14:43,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:43,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:43,739 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 24 treesize of output 16 [2021-11-19 14:14:43,933 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 39 [2021-11-19 14:14:43,937 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 44 treesize of output 37 [2021-11-19 14:14:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-19 14:14:43,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893377219] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:43,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-19 14:14:43,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 23 [2021-11-19 14:14:43,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458984678] [2021-11-19 14:14:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 14:14:43,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 14:14:43,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:14:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 14:14:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2021-11-19 14:14:43,979 INFO L87 Difference]: Start difference. First operand 20514 states and 44915 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-19 14:14:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:14:46,668 INFO L93 Difference]: Finished difference Result 30995 states and 68533 transitions. [2021-11-19 14:14:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-19 14:14:46,669 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-19 14:14:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:14:46,732 INFO L225 Difference]: With dead ends: 30995 [2021-11-19 14:14:46,732 INFO L226 Difference]: Without dead ends: 30995 [2021-11-19 14:14:46,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2021-11-19 14:14:46,734 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 169 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-19 14:14:46,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 41 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-19 14:14:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30995 states. [2021-11-19 14:14:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30995 to 21470. [2021-11-19 14:14:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21470 states, 21457 states have (on average 2.1845551568252786) internal successors, (46874), 21469 states have internal predecessors, (46874), 0 states have call successors, (0), 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-19 14:14:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 46874 transitions. [2021-11-19 14:14:47,497 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 46874 transitions. Word has length 45 [2021-11-19 14:14:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:14:47,497 INFO L470 AbstractCegarLoop]: Abstraction has 21470 states and 46874 transitions. [2021-11-19 14:14:47,497 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-19 14:14:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 46874 transitions. [2021-11-19 14:14:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:14:47,500 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:14:47,501 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1] [2021-11-19 14:14:47,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-19 14:14:47,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-19 14:14:47,704 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:14:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:14:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 832991383, now seen corresponding path program 3 times [2021-11-19 14:14:47,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:14:47,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151173498] [2021-11-19 14:14:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:47,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:14:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:48,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:14:48,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151173498] [2021-11-19 14:14:48,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151173498] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:48,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821330575] [2021-11-19 14:14:48,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 14:14:48,145 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:48,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:14:48,147 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:14:48,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-19 14:14:48,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 14:14:48,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:14:48,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-19 14:14:48,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:14:48,935 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-19 14:14:48,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:48,981 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-19 14:14:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,061 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-19 14:14:49,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,135 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-19 14:14:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:49,395 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-19 14:14:49,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 68 [2021-11-19 14:14:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:49,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:14:49,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:49,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:14:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:14:50,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821330575] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:14:50,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804183142] [2021-11-19 14:14:50,474 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-19 14:14:50,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:14:50,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-19 14:14:50,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887788305] [2021-11-19 14:14:50,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:14:50,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-19 14:14:50,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:14:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-19 14:14:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2021-11-19 14:14:50,477 INFO L87 Difference]: Start difference. First operand 21470 states and 46874 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:14:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:14:57,808 INFO L93 Difference]: Finished difference Result 28910 states and 63077 transitions. [2021-11-19 14:14:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-19 14:14:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:14:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:14:57,913 INFO L225 Difference]: With dead ends: 28910 [2021-11-19 14:14:57,913 INFO L226 Difference]: Without dead ends: 28907 [2021-11-19 14:14:57,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=579, Invalid=2177, Unknown=0, NotChecked=0, Total=2756 [2021-11-19 14:14:57,914 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 824 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 3625 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 3625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2021-11-19 14:14:57,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 346 Invalid, 3895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 3625 Invalid, 0 Unknown, 43 Unchecked, 5.4s Time] [2021-11-19 14:14:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28907 states. [2021-11-19 14:14:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28907 to 21459. [2021-11-19 14:14:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21459 states, 21446 states have (on average 2.184789704373776) internal successors, (46855), 21458 states have internal predecessors, (46855), 0 states have call successors, (0), 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-19 14:14:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 46855 transitions. [2021-11-19 14:14:58,484 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 46855 transitions. Word has length 45 [2021-11-19 14:14:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:14:58,484 INFO L470 AbstractCegarLoop]: Abstraction has 21459 states and 46855 transitions. [2021-11-19 14:14:58,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:14:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 46855 transitions. [2021-11-19 14:14:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:14:58,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:14:58,487 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-19 14:14:58,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-19 14:14:58,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-19 14:14:58,688 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:14:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:14:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash -222457422, now seen corresponding path program 14 times [2021-11-19 14:14:58,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:14:58,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165232931] [2021-11-19 14:14:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:14:58,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:14:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:14:59,073 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-19 14:14:59,074 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:14:59,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165232931] [2021-11-19 14:14:59,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165232931] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:14:59,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819651320] [2021-11-19 14:14:59,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 14:14:59,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:14:59,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:14:59,075 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:14:59,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-19 14:14:59,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 14:14:59,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 14:14:59,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-19 14:14:59,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:14:59,580 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-19 14:14:59,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,622 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-19 14:14:59,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,674 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-19 14:14:59,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,744 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-19 14:14:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:14:59,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 14:14:59,836 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 6 case distinctions, treesize of input 46 treesize of output 54 [2021-11-19 14:14:59,878 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-19 14:14:59,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:15:00,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 14:15:00,907 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-19 14:15:00,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819651320] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:15:00,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [739795496] [2021-11-19 14:15:00,908 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-19 14:15:00,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:15:00,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-19 14:15:00,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815392999] [2021-11-19 14:15:00,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:15:00,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-19 14:15:00,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:15:00,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-19 14:15:00,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2021-11-19 14:15:00,910 INFO L87 Difference]: Start difference. First operand 21459 states and 46855 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:15:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 14:15:06,126 INFO L93 Difference]: Finished difference Result 38863 states and 84777 transitions. [2021-11-19 14:15:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-19 14:15:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:15:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 14:15:06,208 INFO L225 Difference]: With dead ends: 38863 [2021-11-19 14:15:06,208 INFO L226 Difference]: Without dead ends: 38863 [2021-11-19 14:15:06,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1232, Invalid=4930, Unknown=0, NotChecked=0, Total=6162 [2021-11-19 14:15:06,209 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1162 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 3132 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 4240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 874 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-19 14:15:06,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1162 Valid, 394 Invalid, 4240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3132 Invalid, 0 Unknown, 874 Unchecked, 2.8s Time] [2021-11-19 14:15:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38863 states. [2021-11-19 14:15:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38863 to 25273. [2021-11-19 14:15:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25273 states, 25260 states have (on average 2.183927157561362) internal successors, (55166), 25272 states have internal predecessors, (55166), 0 states have call successors, (0), 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-19 14:15:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25273 states to 25273 states and 55166 transitions. [2021-11-19 14:15:07,091 INFO L78 Accepts]: Start accepts. Automaton has 25273 states and 55166 transitions. Word has length 45 [2021-11-19 14:15:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 14:15:07,091 INFO L470 AbstractCegarLoop]: Abstraction has 25273 states and 55166 transitions. [2021-11-19 14:15:07,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 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-19 14:15:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 25273 states and 55166 transitions. [2021-11-19 14:15:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 14:15:07,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 14:15:07,095 INFO L514 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1] [2021-11-19 14:15:07,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-19 14:15:07,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-19 14:15:07,296 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-19 14:15:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 14:15:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash 770997347, now seen corresponding path program 4 times [2021-11-19 14:15:07,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 14:15:07,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121577867] [2021-11-19 14:15:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 14:15:07,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 14:15:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:15:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:15:07,518 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 14:15:07,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121577867] [2021-11-19 14:15:07,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121577867] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 14:15:07,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593689073] [2021-11-19 14:15:07,518 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 14:15:07,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 14:15:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 14:15:07,521 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 14:15:07,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7ea22c4-930b-4a07-96a5-b3387c3cc8f7/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-19 14:15:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 14:15:07,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 14:15:07,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 14:15:07,975 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-19 14:15:08,032 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-19 14:15:08,033 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 32 treesize of output 31 [2021-11-19 14:15:08,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,135 INFO L354 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2021-11-19 14:15:08,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 43 [2021-11-19 14:15:08,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,249 INFO L354 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2021-11-19 14:15:08,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 55 [2021-11-19 14:15:08,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 14:15:08,381 INFO L354 Elim1Store]: treesize reduction 73, result has 13.1 percent of original size [2021-11-19 14:15:08,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 67 [2021-11-19 14:15:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:15:08,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 14:15:08,570 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 14:15:08,570 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-19 14:15:08,576 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:15:08,576 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-19 14:15:08,585 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 14:15:08,585 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-19 14:15:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 14:15:08,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593689073] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 14:15:08,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26943265] [2021-11-19 14:15:08,800 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-19 14:15:08,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 14:15:08,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-19 14:15:08,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092595522] [2021-11-19 14:15:08,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 14:15:08,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-19 14:15:08,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 14:15:08,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-19 14:15:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2021-11-19 14:15:08,802 INFO L87 Difference]: Start difference. First operand 25273 states and 55166 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 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)