./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:55:04,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:55:04,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:55:04,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:55:04,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:55:04,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:55:04,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:55:04,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:55:04,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:55:04,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:55:04,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:55:04,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:55:04,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:55:04,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:55:04,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:55:04,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:55:04,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:55:04,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:55:04,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:55:04,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:55:04,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:55:04,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:55:04,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:55:04,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:55:04,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:55:04,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:55:04,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:55:04,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:55:04,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:55:04,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:55:04,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:55:04,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:55:04,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:55:04,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:55:04,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:55:04,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:55:04,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:55:04,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:55:04,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:55:04,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:55:04,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:55:04,190 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-21 01:55:04,244 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:55:04,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:55:04,245 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:55:04,245 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:55:04,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:55:04,246 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:55:04,247 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:55:04,247 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:55:04,247 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:55:04,247 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:55:04,248 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:55:04,248 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:55:04,249 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:55:04,249 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:55:04,249 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:55:04,249 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:55:04,249 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:55:04,250 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:55:04,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:55:04,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:55:04,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:55:04,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:55:04,253 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-21 01:55:04,254 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:55:04,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:55:04,254 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:55:04,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:55:04,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:55:04,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:55:04,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:55:04,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:55:04,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:55:04,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:55:04,256 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:55:04,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:55:04,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:55:04,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:55:04,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:55:04,256 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_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2021-11-21 01:55:04,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:55:04,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:55:04,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:55:04,572 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:55:04,573 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:55:04,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-21 01:55:04,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/fbde00276/c00e04127b984623b86de15ce1a428d3/FLAG2863e5d15 [2021-11-21 01:55:05,246 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:55:05,247 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-21 01:55:05,272 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/fbde00276/c00e04127b984623b86de15ce1a428d3/FLAG2863e5d15 [2021-11-21 01:55:05,493 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/fbde00276/c00e04127b984623b86de15ce1a428d3 [2021-11-21 01:55:05,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:55:05,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:55:05,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:55:05,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:55:05,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:55:05,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:05" (1/1) ... [2021-11-21 01:55:05,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ef186d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:05, skipping insertion in model container [2021-11-21 01:55:05,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:55:05" (1/1) ... [2021-11-21 01:55:05,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:55:05,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:55:06,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:55:06,078 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:55:06,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:55:06,218 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:55:06,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06 WrapperNode [2021-11-21 01:55:06,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:55:06,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:55:06,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:55:06,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:55:06,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,281 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2021-11-21 01:55:06,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:55:06,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:55:06,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:55:06,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:55:06,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:55:06,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:55:06,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:55:06,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:55:06,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (1/1) ... [2021-11-21 01:55:06,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:55:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:06,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:55:06,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:55:06,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:55:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:55:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:55:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 01:55:06,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-21 01:55:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:55:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-21 01:55:06,472 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-21 01:55:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:55:06,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:55:06,474 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-21 01:55:06,639 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:55:06,642 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:55:06,989 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:55:06,999 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:55:06,999 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-21 01:55:07,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:07 BoogieIcfgContainer [2021-11-21 01:55:07,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:55:07,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:55:07,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:55:07,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:55:07,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:55:05" (1/3) ... [2021-11-21 01:55:07,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496cbeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:07, skipping insertion in model container [2021-11-21 01:55:07,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:55:06" (2/3) ... [2021-11-21 01:55:07,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496cbeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:55:07, skipping insertion in model container [2021-11-21 01:55:07,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:55:07" (3/3) ... [2021-11-21 01:55:07,013 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2021-11-21 01:55:07,019 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-21 01:55:07,019 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:55:07,020 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-21 01:55:07,020 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-21 01:55:07,060 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,062 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,063 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,064 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,065 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,066 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-21 01:55:07,066 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-21 01:55:07,066 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,066 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-21 01:55:07,066 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-21 01:55:07,066 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-21 01:55:07,066 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-21 01:55:07,066 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,067 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,068 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-21 01:55:07,069 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-21 01:55:07,069 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-21 01:55:07,069 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-21 01:55:07,069 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-21 01:55:07,069 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-21 01:55:07,069 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-21 01:55:07,070 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-21 01:55:07,070 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-21 01:55:07,070 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-21 01:55:07,070 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-21 01:55:07,070 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-21 01:55:07,071 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-21 01:55:07,071 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-21 01:55:07,071 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-21 01:55:07,071 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-21 01:55:07,071 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-21 01:55:07,072 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-21 01:55:07,072 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-21 01:55:07,072 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-21 01:55:07,072 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-21 01:55:07,073 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-21 01:55:07,073 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-21 01:55:07,073 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-21 01:55:07,073 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-21 01:55:07,073 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-21 01:55:07,074 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-21 01:55:07,074 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-21 01:55:07,074 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-21 01:55:07,074 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-21 01:55:07,074 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-21 01:55:07,075 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-21 01:55:07,075 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-21 01:55:07,075 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-21 01:55:07,075 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-21 01:55:07,076 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-21 01:55:07,076 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-21 01:55:07,077 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-21 01:55:07,078 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-21 01:55:07,078 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-21 01:55:07,078 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-21 01:55:07,078 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-21 01:55:07,079 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-21 01:55:07,079 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-21 01:55:07,079 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-21 01:55:07,079 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-21 01:55:07,080 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-21 01:55:07,080 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-21 01:55:07,080 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-21 01:55:07,080 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-21 01:55:07,080 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-21 01:55:07,081 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-21 01:55:07,081 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-21 01:55:07,081 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-21 01:55:07,081 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-21 01:55:07,081 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-21 01:55:07,082 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-21 01:55:07,082 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-21 01:55:07,082 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-21 01:55:07,082 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-21 01:55:07,082 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-21 01:55:07,083 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-21 01:55:07,083 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-21 01:55:07,083 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-21 01:55:07,083 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-21 01:55:07,083 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-21 01:55:07,084 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-21 01:55:07,084 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-21 01:55:07,084 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-21 01:55:07,084 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-21 01:55:07,084 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-21 01:55:07,084 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-21 01:55:07,085 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-21 01:55:07,085 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-21 01:55:07,085 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-21 01:55:07,085 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-21 01:55:07,085 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-21 01:55:07,086 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-21 01:55:07,086 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-21 01:55:07,086 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-21 01:55:07,086 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-21 01:55:07,087 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-21 01:55:07,087 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-21 01:55:07,087 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-21 01:55:07,087 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-21 01:55:07,087 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-21 01:55:07,088 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-21 01:55:07,088 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-21 01:55:07,088 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-21 01:55:07,088 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-21 01:55:07,089 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-21 01:55:07,089 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-21 01:55:07,089 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-21 01:55:07,089 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-21 01:55:07,089 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-21 01:55:07,090 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-21 01:55:07,090 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-21 01:55:07,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,095 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,096 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-21 01:55:07,096 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-21 01:55:07,097 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-21 01:55:07,097 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-21 01:55:07,097 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-21 01:55:07,097 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-21 01:55:07,098 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-21 01:55:07,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 01:55:07,098 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-21 01:55:07,101 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-21 01:55:07,153 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:55:07,160 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-21 01:55:07,161 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-21 01:55:07,178 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-21 01:55:07,231 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-21 01:55:07,245 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-21 01:55:07,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2021-11-21 01:55:07,354 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2021-11-21 01:55:07,355 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-21 01:55:07,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2021-11-21 01:55:07,368 INFO L116 LiptonReduction]: Number of co-enabled transitions 4864 [2021-11-21 01:55:09,860 INFO L131 LiptonReduction]: Checked pairs total: 16173 [2021-11-21 01:55:09,861 INFO L133 LiptonReduction]: Total number of compositions: 75 [2021-11-21 01:55:09,871 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2021-11-21 01:55:09,912 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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-21 01:55:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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-21 01:55:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 01:55:09,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:09,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:09,927 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2114734191, now seen corresponding path program 1 times [2021-11-21 01:55:09,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:09,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485870446] [2021-11-21 01:55:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:09,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:10,139 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-21 01:55:10,140 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:10,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485870446] [2021-11-21 01:55:10,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485870446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:10,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:55:10,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:55:10,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75874543] [2021-11-21 01:55:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:10,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:55:10,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:55:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:55:10,187 INFO L87 Difference]: Start difference. First operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:10,304 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2021-11-21 01:55:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:55:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-21 01:55:10,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:10,335 INFO L225 Difference]: With dead ends: 596 [2021-11-21 01:55:10,336 INFO L226 Difference]: Without dead ends: 596 [2021-11-21 01:55:10,338 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-21 01:55:10,350 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:10,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-21 01:55:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-21 01:55:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 582 states have (on average 2.042955326460481) internal successors, (1189), 595 states have internal predecessors, (1189), 0 states have call successors, (0), 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-21 01:55:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2021-11-21 01:55:10,466 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2021-11-21 01:55:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:10,466 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2021-11-21 01:55:10,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2021-11-21 01:55:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-21 01:55:10,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:10,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:10,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:55:10,470 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1783178182, now seen corresponding path program 1 times [2021-11-21 01:55:10,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:10,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653295122] [2021-11-21 01:55:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:10,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:10,537 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-21 01:55:10,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:10,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653295122] [2021-11-21 01:55:10,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653295122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:10,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100105487] [2021-11-21 01:55:10,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:10,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:10,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:10,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:10,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:55:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:10,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:55:10,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:10,736 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-21 01:55:10,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:10,782 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-21 01:55:10,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100105487] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233310754] [2021-11-21 01:55:10,789 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-21 01:55:10,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:10,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-21 01:55:10,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525711809] [2021-11-21 01:55:10,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:10,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:55:10,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:10,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:55:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:55:10,794 INFO L87 Difference]: Start difference. First operand 596 states and 1189 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 01:55:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:10,870 INFO L93 Difference]: Finished difference Result 599 states and 1192 transitions. [2021-11-21 01:55:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 01:55:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:10,875 INFO L225 Difference]: With dead ends: 599 [2021-11-21 01:55:10,875 INFO L226 Difference]: Without dead ends: 599 [2021-11-21 01:55:10,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:55:10,882 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:10,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-21 01:55:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-21 01:55:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 585 states have (on average 2.0376068376068375) internal successors, (1192), 598 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1192 transitions. [2021-11-21 01:55:10,915 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1192 transitions. Word has length 12 [2021-11-21 01:55:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:10,916 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1192 transitions. [2021-11-21 01:55:10,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 01:55:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1192 transitions. [2021-11-21 01:55:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:55:10,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:10,924 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:10,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-21 01:55:11,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-11-21 01:55:11,153 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:11,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash -336848431, now seen corresponding path program 2 times [2021-11-21 01:55:11,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:11,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928885199] [2021-11-21 01:55:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:11,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:11,319 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-21 01:55:11,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:11,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928885199] [2021-11-21 01:55:11,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928885199] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826146841] [2021-11-21 01:55:11,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:55:11,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:11,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:11,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:55:11,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 01:55:11,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:55:11,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:55:11,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:11,458 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-21 01:55:11,501 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-21 01:55:11,503 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-21 01:55:11,552 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-21 01:55:11,553 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-21 01:55:11,613 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-21 01:55:11,614 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-21 01:55:11,643 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-21 01:55:11,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:55:11,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826146841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:11,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:55:11,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2021-11-21 01:55:11,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272877819] [2021-11-21 01:55:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:11,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:11,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:55:11,647 INFO L87 Difference]: Start difference. First operand 599 states and 1192 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-21 01:55:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:12,310 INFO L93 Difference]: Finished difference Result 790 states and 1574 transitions. [2021-11-21 01:55:12,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:12,316 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-21 01:55:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:12,324 INFO L225 Difference]: With dead ends: 790 [2021-11-21 01:55:12,324 INFO L226 Difference]: Without dead ends: 790 [2021-11-21 01:55:12,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:55:12,326 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:12,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 38 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 01:55:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-11-21 01:55:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 726. [2021-11-21 01:55:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 712 states have (on average 2.0308988764044944) internal successors, (1446), 725 states have internal predecessors, (1446), 0 states have call successors, (0), 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-21 01:55:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1446 transitions. [2021-11-21 01:55:12,355 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1446 transitions. Word has length 15 [2021-11-21 01:55:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:12,355 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1446 transitions. [2021-11-21 01:55:12,356 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-21 01:55:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1446 transitions. [2021-11-21 01:55:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:55:12,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:12,357 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:12,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:12,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:12,577 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:12,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:12,578 INFO L85 PathProgramCache]: Analyzing trace with hash 202679984, now seen corresponding path program 1 times [2021-11-21 01:55:12,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:12,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328626771] [2021-11-21 01:55:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:12,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:12,632 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-21 01:55:12,632 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328626771] [2021-11-21 01:55:12,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328626771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:12,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:55:12,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:55:12,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545825662] [2021-11-21 01:55:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:12,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:55:12,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:55:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:55:12,635 INFO L87 Difference]: Start difference. First operand 726 states and 1446 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 01:55:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:12,701 INFO L93 Difference]: Finished difference Result 1028 states and 2050 transitions. [2021-11-21 01:55:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:55:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 01:55:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:12,710 INFO L225 Difference]: With dead ends: 1028 [2021-11-21 01:55:12,710 INFO L226 Difference]: Without dead ends: 1028 [2021-11-21 01:55:12,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:55:12,713 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:12,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-21 01:55:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 743. [2021-11-21 01:55:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 729 states have (on average 2.0301783264746227) internal successors, (1480), 742 states have internal predecessors, (1480), 0 states have call successors, (0), 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-21 01:55:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1480 transitions. [2021-11-21 01:55:12,750 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1480 transitions. Word has length 15 [2021-11-21 01:55:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:12,750 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1480 transitions. [2021-11-21 01:55:12,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-21 01:55:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1480 transitions. [2021-11-21 01:55:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:55:12,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:12,752 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:12,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:55:12,752 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2013723712, now seen corresponding path program 1 times [2021-11-21 01:55:12,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:12,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438947184] [2021-11-21 01:55:12,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:12,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:12,858 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-21 01:55:12,858 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:12,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438947184] [2021-11-21 01:55:12,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438947184] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:12,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028370164] [2021-11-21 01:55:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:12,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:12,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:12,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:12,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 01:55:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:12,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 01:55:12,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:12,980 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-21 01:55:12,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:13,112 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-21 01:55:13,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028370164] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:13,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [833439226] [2021-11-21 01:55:13,113 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-21 01:55:13,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:13,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-21 01:55:13,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505110035] [2021-11-21 01:55:13,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:13,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 01:55:13,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 01:55:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-21 01:55:13,115 INFO L87 Difference]: Start difference. First operand 743 states and 1480 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-21 01:55:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:13,214 INFO L93 Difference]: Finished difference Result 749 states and 1486 transitions. [2021-11-21 01:55:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 01:55:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-21 01:55:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:13,220 INFO L225 Difference]: With dead ends: 749 [2021-11-21 01:55:13,220 INFO L226 Difference]: Without dead ends: 749 [2021-11-21 01:55:13,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-21 01:55:13,228 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:13,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-21 01:55:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2021-11-21 01:55:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 735 states have (on average 2.0217687074829933) internal successors, (1486), 748 states have internal predecessors, (1486), 0 states have call successors, (0), 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-21 01:55:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1486 transitions. [2021-11-21 01:55:13,253 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1486 transitions. Word has length 15 [2021-11-21 01:55:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:13,253 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 1486 transitions. [2021-11-21 01:55:13,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-21 01:55:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1486 transitions. [2021-11-21 01:55:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-21 01:55:13,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:13,255 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:55:13,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:13,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:13,469 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -805061856, now seen corresponding path program 2 times [2021-11-21 01:55:13,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:13,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828377124] [2021-11-21 01:55:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:13,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:13,630 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-21 01:55:13,630 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:13,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828377124] [2021-11-21 01:55:13,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828377124] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:13,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:55:13,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:55:13,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904555762] [2021-11-21 01:55:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:13,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:13,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:55:13,633 INFO L87 Difference]: Start difference. First operand 749 states and 1486 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-21 01:55:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:14,020 INFO L93 Difference]: Finished difference Result 839 states and 1666 transitions. [2021-11-21 01:55:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:14,020 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-21 01:55:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:14,025 INFO L225 Difference]: With dead ends: 839 [2021-11-21 01:55:14,025 INFO L226 Difference]: Without dead ends: 839 [2021-11-21 01:55:14,025 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-21 01:55:14,026 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:14,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 01:55:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-21 01:55:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 807. [2021-11-21 01:55:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 794 states have (on average 2.017632241813602) internal successors, (1602), 806 states have internal predecessors, (1602), 0 states have call successors, (0), 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-21 01:55:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1602 transitions. [2021-11-21 01:55:14,052 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1602 transitions. Word has length 21 [2021-11-21 01:55:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:14,052 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1602 transitions. [2021-11-21 01:55:14,052 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-21 01:55:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1602 transitions. [2021-11-21 01:55:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 01:55:14,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:14,054 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-21 01:55:14,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 01:55:14,054 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2074507123, now seen corresponding path program 1 times [2021-11-21 01:55:14,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:14,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587323060] [2021-11-21 01:55:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:14,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:14,171 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-21 01:55:14,171 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587323060] [2021-11-21 01:55:14,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587323060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:14,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:55:14,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:55:14,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650424867] [2021-11-21 01:55:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:14,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:14,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:14,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:14,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:55:14,173 INFO L87 Difference]: Start difference. First operand 807 states and 1602 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-21 01:55:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:14,792 INFO L93 Difference]: Finished difference Result 967 states and 1922 transitions. [2021-11-21 01:55:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:14,793 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-21 01:55:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:14,800 INFO L225 Difference]: With dead ends: 967 [2021-11-21 01:55:14,800 INFO L226 Difference]: Without dead ends: 935 [2021-11-21 01:55:14,801 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-21 01:55:14,802 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:14,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 01:55:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-21 01:55:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 902. [2021-11-21 01:55:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 889 states have (on average 2.0112485939257594) internal successors, (1788), 901 states have internal predecessors, (1788), 0 states have call successors, (0), 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-21 01:55:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1788 transitions. [2021-11-21 01:55:14,834 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1788 transitions. Word has length 27 [2021-11-21 01:55:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:14,835 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1788 transitions. [2021-11-21 01:55:14,835 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-21 01:55:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1788 transitions. [2021-11-21 01:55:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 01:55:14,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:14,836 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-21 01:55:14,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-21 01:55:14,837 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -444468531, now seen corresponding path program 1 times [2021-11-21 01:55:14,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481830718] [2021-11-21 01:55:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:14,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:14,966 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-21 01:55:14,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:14,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481830718] [2021-11-21 01:55:14,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481830718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:14,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:55:14,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:55:14,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833743891] [2021-11-21 01:55:14,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:14,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:14,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:14,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:55:14,969 INFO L87 Difference]: Start difference. First operand 902 states and 1788 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-21 01:55:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:15,309 INFO L93 Difference]: Finished difference Result 967 states and 1918 transitions. [2021-11-21 01:55:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:15,309 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-21 01:55:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:15,317 INFO L225 Difference]: With dead ends: 967 [2021-11-21 01:55:15,317 INFO L226 Difference]: Without dead ends: 967 [2021-11-21 01:55:15,317 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-21 01:55:15,318 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:15,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:55:15,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-11-21 01:55:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-11-21 01:55:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 954 states have (on average 2.010482180293501) internal successors, (1918), 966 states have internal predecessors, (1918), 0 states have call successors, (0), 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-21 01:55:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1918 transitions. [2021-11-21 01:55:15,354 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1918 transitions. Word has length 27 [2021-11-21 01:55:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:15,354 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1918 transitions. [2021-11-21 01:55:15,354 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-21 01:55:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1918 transitions. [2021-11-21 01:55:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 01:55:15,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:15,356 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-21 01:55:15,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-21 01:55:15,357 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:15,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1511693174, now seen corresponding path program 1 times [2021-11-21 01:55:15,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:15,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764002231] [2021-11-21 01:55:15,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:15,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:15,565 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-21 01:55:15,565 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764002231] [2021-11-21 01:55:15,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764002231] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160997304] [2021-11-21 01:55:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:15,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:15,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:15,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 01:55:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:15,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:55:15,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:15,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-21 01:55:15,824 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-21 01:55:15,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:55:15,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160997304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:15,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:55:15,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 01:55:15,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614550434] [2021-11-21 01:55:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:15,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:15,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:15,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:55:15,827 INFO L87 Difference]: Start difference. First operand 967 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:16,015 INFO L93 Difference]: Finished difference Result 2184 states and 4322 transitions. [2021-11-21 01:55:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-21 01:55:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:16,033 INFO L225 Difference]: With dead ends: 2184 [2021-11-21 01:55:16,033 INFO L226 Difference]: Without dead ends: 2184 [2021-11-21 01:55:16,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-21 01:55:16,034 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:16,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:16,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-11-21 01:55:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1024. [2021-11-21 01:55:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1011 states have (on average 1.9841740850642928) internal successors, (2006), 1023 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2006 transitions. [2021-11-21 01:55:16,082 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2006 transitions. Word has length 31 [2021-11-21 01:55:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:16,083 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2006 transitions. [2021-11-21 01:55:16,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2006 transitions. [2021-11-21 01:55:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 01:55:16,084 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:16,085 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-21 01:55:16,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:16,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:16,301 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -782408396, now seen corresponding path program 2 times [2021-11-21 01:55:16,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:16,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463831712] [2021-11-21 01:55:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:16,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:16,441 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-21 01:55:16,441 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:16,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463831712] [2021-11-21 01:55:16,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463831712] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:16,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485939867] [2021-11-21 01:55:16,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:55:16,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:16,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:16,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-21 01:55:16,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 01:55:16,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:55:16,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:55:16,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:16,590 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-21 01:55:16,678 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-21 01:55:16,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:55:16,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485939867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:16,678 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:55:16,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 01:55:16,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806045938] [2021-11-21 01:55:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:16,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:16,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:55:16,682 INFO L87 Difference]: Start difference. First operand 1024 states and 2006 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:16,876 INFO L93 Difference]: Finished difference Result 2484 states and 4895 transitions. [2021-11-21 01:55:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:16,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-21 01:55:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:16,895 INFO L225 Difference]: With dead ends: 2484 [2021-11-21 01:55:16,895 INFO L226 Difference]: Without dead ends: 2484 [2021-11-21 01:55:16,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-21 01:55:16,896 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 170 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:16,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 122 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-11-21 01:55:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1037. [2021-11-21 01:55:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1024 states have (on average 1.984375) internal successors, (2032), 1036 states have internal predecessors, (2032), 0 states have call successors, (0), 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-21 01:55:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2032 transitions. [2021-11-21 01:55:16,960 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2032 transitions. Word has length 31 [2021-11-21 01:55:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:16,961 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 2032 transitions. [2021-11-21 01:55:16,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2032 transitions. [2021-11-21 01:55:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 01:55:16,962 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:16,962 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-21 01:55:16,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:17,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:17,189 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1917489978, now seen corresponding path program 3 times [2021-11-21 01:55:17,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313920832] [2021-11-21 01:55:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:17,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:17,316 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-21 01:55:17,316 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313920832] [2021-11-21 01:55:17,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313920832] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078047296] [2021-11-21 01:55:17,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 01:55:17,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:17,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:17,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:17,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 01:55:17,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 01:55:17,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:55:17,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 01:55:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:17,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-21 01:55:17,567 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-21 01:55:17,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:55:17,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078047296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:55:17,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:55:17,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 01:55:17,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21259711] [2021-11-21 01:55:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:55:17,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:55:17,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:55:17,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:55:17,573 INFO L87 Difference]: Start difference. First operand 1037 states and 2032 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:17,730 INFO L93 Difference]: Finished difference Result 1904 states and 3740 transitions. [2021-11-21 01:55:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:55:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-21 01:55:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:17,744 INFO L225 Difference]: With dead ends: 1904 [2021-11-21 01:55:17,744 INFO L226 Difference]: Without dead ends: 1904 [2021-11-21 01:55:17,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-21 01:55:17,746 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:17,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-11-21 01:55:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1049. [2021-11-21 01:55:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1036 states have (on average 1.9845559845559846) internal successors, (2056), 1048 states have internal predecessors, (2056), 0 states have call successors, (0), 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-21 01:55:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2056 transitions. [2021-11-21 01:55:17,786 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2056 transitions. Word has length 31 [2021-11-21 01:55:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:17,786 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 2056 transitions. [2021-11-21 01:55:17,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:55:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2056 transitions. [2021-11-21 01:55:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-21 01:55:17,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:17,788 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, 1, 1, 1, 1] [2021-11-21 01:55:17,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:18,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-21 01:55:18,013 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:18,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash -643420328, now seen corresponding path program 1 times [2021-11-21 01:55:18,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:18,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938551667] [2021-11-21 01:55:18,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:18,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-21 01:55:18,066 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:18,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938551667] [2021-11-21 01:55:18,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938551667] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:18,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051394381] [2021-11-21 01:55:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:18,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:18,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:18,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-21 01:55:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:18,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 01:55:18,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-21 01:55:18,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-21 01:55:18,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051394381] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:18,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506669655] [2021-11-21 01:55:18,299 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-21 01:55:18,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-21 01:55:18,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609188115] [2021-11-21 01:55:18,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:18,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:55:18,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:18,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:55:18,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:55:18,304 INFO L87 Difference]: Start difference. First operand 1049 states and 2056 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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-21 01:55:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:18,443 INFO L93 Difference]: Finished difference Result 2629 states and 5216 transitions. [2021-11-21 01:55:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:55:18,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-21 01:55:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:18,464 INFO L225 Difference]: With dead ends: 2629 [2021-11-21 01:55:18,465 INFO L226 Difference]: Without dead ends: 2629 [2021-11-21 01:55:18,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:55:18,466 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:18,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 154 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:55:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2021-11-21 01:55:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2494. [2021-11-21 01:55:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2481 states have (on average 2.047964530431278) internal successors, (5081), 2493 states have internal predecessors, (5081), 0 states have call successors, (0), 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-21 01:55:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2021-11-21 01:55:18,576 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2021-11-21 01:55:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:18,578 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2021-11-21 01:55:18,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 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-21 01:55:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2021-11-21 01:55:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:55:18,580 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:18,580 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-21 01:55:18,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:18,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-21 01:55:18,798 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash -329216545, now seen corresponding path program 1 times [2021-11-21 01:55:18,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:18,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288851321] [2021-11-21 01:55:18,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:18,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:19,258 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-21 01:55:19,258 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:19,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288851321] [2021-11-21 01:55:19,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288851321] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:19,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603817338] [2021-11-21 01:55:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:19,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:19,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:19,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-21 01:55:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:19,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-21 01:55:19,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:19,967 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-21 01:55:20,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,034 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-21 01:55:20,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,110 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-21 01:55:20,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,209 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-21 01:55:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:20,368 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-21 01:55:20,368 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 4 case distinctions, treesize of input 60 treesize of output 68 [2021-11-21 01:55:20,495 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-21 01:55:20,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:20,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:20,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:21,438 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-21 01:55:21,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603817338] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1759524439] [2021-11-21 01:55:21,439 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-21 01:55:21,440 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:21,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 01:55:21,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571176238] [2021-11-21 01:55:21,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:21,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 01:55:21,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 01:55:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2021-11-21 01:55:21,443 INFO L87 Difference]: Start difference. First operand 2494 states and 5081 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-21 01:55:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:26,710 INFO L93 Difference]: Finished difference Result 10550 states and 21429 transitions. [2021-11-21 01:55:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-21 01:55:26,711 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-21 01:55:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:26,786 INFO L225 Difference]: With dead ends: 10550 [2021-11-21 01:55:26,786 INFO L226 Difference]: Without dead ends: 10550 [2021-11-21 01:55:26,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=595, Invalid=2267, Unknown=0, NotChecked=0, Total=2862 [2021-11-21 01:55:26,789 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 872 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:26,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 245 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2936 Invalid, 0 Unknown, 35 Unchecked, 3.5s Time] [2021-11-21 01:55:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10550 states. [2021-11-21 01:55:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10550 to 6001. [2021-11-21 01:55:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 5988 states have (on average 2.14812959251837) internal successors, (12863), 6000 states have internal predecessors, (12863), 0 states have call successors, (0), 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-21 01:55:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 12863 transitions. [2021-11-21 01:55:27,102 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 12863 transitions. Word has length 45 [2021-11-21 01:55:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:27,103 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 12863 transitions. [2021-11-21 01:55:27,104 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-21 01:55:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 12863 transitions. [2021-11-21 01:55:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:55:27,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:27,108 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-21 01:55:27,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:27,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-21 01:55:27,329 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-21 01:55:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1700766169, now seen corresponding path program 1 times [2021-11-21 01:55:27,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:27,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594553941] [2021-11-21 01:55:27,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:27,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:27,598 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-21 01:55:27,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594553941] [2021-11-21 01:55:27,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594553941] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270442318] [2021-11-21 01:55:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:27,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:27,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:27,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-21 01:55:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:27,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:55:27,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:28,193 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-21 01:55:28,251 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-21 01:55:28,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-21 01:55:28,294 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-21 01:55:28,295 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-21 01:55:28,348 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-21 01:55:28,348 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-21 01:55:28,413 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-21 01:55:28,414 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-21 01:55:28,456 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-21 01:55:28,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:28,567 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 01:55:28,568 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-21 01:55:28,576 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-21 01:55:28,579 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-21 01:55:28,835 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-21 01:55:28,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270442318] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:28,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [741724494] [2021-11-21 01:55:28,836 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-21 01:55:28,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:28,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-21 01:55:28,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365794348] [2021-11-21 01:55:28,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:28,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-21 01:55:28,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-21 01:55:28,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-11-21 01:55:28,839 INFO L87 Difference]: Start difference. First operand 6001 states and 12863 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-21 01:55:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:55:36,029 INFO L93 Difference]: Finished difference Result 12679 states and 25789 transitions. [2021-11-21 01:55:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-21 01:55:36,030 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-21 01:55:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:55:36,104 INFO L225 Difference]: With dead ends: 12679 [2021-11-21 01:55:36,104 INFO L226 Difference]: Without dead ends: 12679 [2021-11-21 01:55:36,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2220, Invalid=9336, Unknown=0, NotChecked=0, Total=11556 [2021-11-21 01:55:36,110 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1333 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 6625 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 7461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 6625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:55:36,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1333 Valid, 334 Invalid, 7461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 6625 Invalid, 0 Unknown, 400 Unchecked, 4.2s Time] [2021-11-21 01:55:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2021-11-21 01:55:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 6071. [2021-11-21 01:55:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6071 states, 6058 states have (on average 2.146417959722681) internal successors, (13003), 6070 states have internal predecessors, (13003), 0 states have call successors, (0), 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-21 01:55:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13003 transitions. [2021-11-21 01:55:36,390 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13003 transitions. Word has length 45 [2021-11-21 01:55:36,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:55:36,392 INFO L470 AbstractCegarLoop]: Abstraction has 6071 states and 13003 transitions. [2021-11-21 01:55:36,393 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-21 01:55:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13003 transitions. [2021-11-21 01:55:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:55:36,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:55:36,399 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-21 01:55:36,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-21 01:55:36,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:36,625 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:55:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:55:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1883138674, now seen corresponding path program 1 times [2021-11-21 01:55:36,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:55:36,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680270065] [2021-11-21 01:55:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:36,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:55:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:37,492 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-21 01:55:37,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:55:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680270065] [2021-11-21 01:55:37,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680270065] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:55:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025065233] [2021-11-21 01:55:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:55:37,494 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:55:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:55:37,495 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:55:37,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 01:55:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:55:37,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-21 01:55:37,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:55:37,987 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-21 01:55:38,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,047 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-21 01:55:38,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,119 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-21 01:55:38,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,246 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-21 01:55:38,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,344 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-21 01:55:38,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,441 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-21 01:55:38,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,560 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-21 01:55:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,692 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-21 01:55:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:55:38,997 INFO L354 Elim1Store]: treesize reduction 615, result has 10.7 percent of original size [2021-11-21 01:55:38,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 111 treesize of output 119 [2021-11-21 01:55:51,133 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-21 01:55:51,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:55:53,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:53,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:55:54,512 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-21 01:55:54,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025065233] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:55:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1084280365] [2021-11-21 01:55:54,513 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-21 01:55:54,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:55:54,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-21 01:55:54,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912098191] [2021-11-21 01:55:54,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:55:54,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-21 01:55:54,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:55:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-21 01:55:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1191, Unknown=5, NotChecked=0, Total=1482 [2021-11-21 01:55:54,517 INFO L87 Difference]: Start difference. First operand 6071 states and 13003 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-21 01:56:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:56:27,619 INFO L93 Difference]: Finished difference Result 12223 states and 24898 transitions. [2021-11-21 01:56:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-21 01:56:27,620 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-21 01:56:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:56:27,664 INFO L225 Difference]: With dead ends: 12223 [2021-11-21 01:56:27,664 INFO L226 Difference]: Without dead ends: 12223 [2021-11-21 01:56:27,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=1207, Invalid=4478, Unknown=15, NotChecked=0, Total=5700 [2021-11-21 01:56:27,668 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 857 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1363 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:56:27,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 280 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3108 Invalid, 0 Unknown, 1363 Unchecked, 2.4s Time] [2021-11-21 01:56:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2021-11-21 01:56:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 6268. [2021-11-21 01:56:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6255 states have (on average 2.143725019984013) internal successors, (13409), 6267 states have internal predecessors, (13409), 0 states have call successors, (0), 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-21 01:56:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13409 transitions. [2021-11-21 01:56:27,926 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13409 transitions. Word has length 45 [2021-11-21 01:56:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:56:27,927 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 13409 transitions. [2021-11-21 01:56:27,927 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-21 01:56:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13409 transitions. [2021-11-21 01:56:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:56:27,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:56:27,931 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-21 01:56:27,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 01:56:28,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-21 01:56:28,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:56:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:56:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2029288535, now seen corresponding path program 1 times [2021-11-21 01:56:28,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:56:28,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821327725] [2021-11-21 01:56:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:56:28,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:56:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:56:28,667 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-21 01:56:28,667 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:56:28,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821327725] [2021-11-21 01:56:28,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821327725] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:56:28,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841424133] [2021-11-21 01:56:28,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:56:28,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:56:28,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:56:28,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:56:28,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-21 01:56:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:56:28,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:56:28,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:56:29,158 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-21 01:56:29,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,206 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-21 01:56:29,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,263 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-21 01:56:29,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:29,343 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-21 01:56:29,472 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 01:56:29,472 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-21 01:56:29,554 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-21 01:56:29,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:56:29,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:29,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:30,429 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-21 01:56:30,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841424133] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:56:30,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [633702857] [2021-11-21 01:56:30,430 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-21 01:56:30,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:56:30,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 01:56:30,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858687070] [2021-11-21 01:56:30,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:56:30,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 01:56:30,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:56:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 01:56:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2021-11-21 01:56:30,433 INFO L87 Difference]: Start difference. First operand 6268 states and 13409 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-21 01:56:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:56:41,704 INFO L93 Difference]: Finished difference Result 12441 states and 25326 transitions. [2021-11-21 01:56:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-21 01:56:41,705 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-21 01:56:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:56:41,740 INFO L225 Difference]: With dead ends: 12441 [2021-11-21 01:56:41,740 INFO L226 Difference]: Without dead ends: 12441 [2021-11-21 01:56:41,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1544, Invalid=6646, Unknown=0, NotChecked=0, Total=8190 [2021-11-21 01:56:41,747 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1191 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-11-21 01:56:41,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 293 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5144 Invalid, 0 Unknown, 82 Unchecked, 7.5s Time] [2021-11-21 01:56:41,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12441 states. [2021-11-21 01:56:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12441 to 6478. [2021-11-21 01:56:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6478 states, 6465 states have (on average 2.1415313225058004) internal successors, (13845), 6477 states have internal predecessors, (13845), 0 states have call successors, (0), 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-21 01:56:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 13845 transitions. [2021-11-21 01:56:42,093 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 13845 transitions. Word has length 45 [2021-11-21 01:56:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:56:42,093 INFO L470 AbstractCegarLoop]: Abstraction has 6478 states and 13845 transitions. [2021-11-21 01:56:42,094 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-21 01:56:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 13845 transitions. [2021-11-21 01:56:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:56:42,097 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:56:42,098 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-21 01:56:42,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-21 01:56:42,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-21 01:56:42,313 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:56:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:56:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -873806249, now seen corresponding path program 2 times [2021-11-21 01:56:42,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:56:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098780460] [2021-11-21 01:56:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:56:42,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:56:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:56:42,702 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-21 01:56:42,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:56:42,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098780460] [2021-11-21 01:56:42,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098780460] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:56:42,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102117183] [2021-11-21 01:56:42,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:56:42,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:56:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:56:42,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:56:42,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-21 01:56:42,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 01:56:42,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:56:42,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 01:56:42,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:56:42,995 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-21 01:56:43,195 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-21 01:56:43,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,266 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-21 01:56:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,357 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-21 01:56:43,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:43,466 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-21 01:56:43,578 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-21 01:56:43,579 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-21 01:56:43,765 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-21 01:56:43,765 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-21 01:56:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-21 01:56:43,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:56:44,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:56:44,619 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-21 01:56:44,622 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-21 01:56:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-21 01:56:44,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102117183] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:56:44,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-21 01:56:44,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-21 01:56:44,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385503355] [2021-11-21 01:56:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:56:44,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 01:56:44,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:56:44,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 01:56:44,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2021-11-21 01:56:44,672 INFO L87 Difference]: Start difference. First operand 6478 states and 13845 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-21 01:56:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:56:48,902 INFO L93 Difference]: Finished difference Result 8036 states and 17070 transitions. [2021-11-21 01:56:48,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-21 01:56:48,903 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-21 01:56:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:56:48,921 INFO L225 Difference]: With dead ends: 8036 [2021-11-21 01:56:48,921 INFO L226 Difference]: Without dead ends: 8036 [2021-11-21 01:56:48,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=208, Invalid=913, Unknown=1, NotChecked=0, Total=1122 [2021-11-21 01:56:48,923 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:56:48,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 43 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2021-11-21 01:56:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2021-11-21 01:56:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 6615. [2021-11-21 01:56:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6602 states have (on average 2.1422296273856407) internal successors, (14143), 6614 states have internal predecessors, (14143), 0 states have call successors, (0), 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-21 01:56:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 14143 transitions. [2021-11-21 01:56:49,166 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 14143 transitions. Word has length 45 [2021-11-21 01:56:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:56:49,167 INFO L470 AbstractCegarLoop]: Abstraction has 6615 states and 14143 transitions. [2021-11-21 01:56:49,167 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-21 01:56:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 14143 transitions. [2021-11-21 01:56:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:56:49,171 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:56:49,171 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-21 01:56:49,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-21 01:56:49,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:56:49,389 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:56:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:56:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -799626659, now seen corresponding path program 3 times [2021-11-21 01:56:49,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:56:49,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113129426] [2021-11-21 01:56:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:56:49,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:56:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:56:49,796 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-21 01:56:49,796 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:56:49,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113129426] [2021-11-21 01:56:49,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113129426] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:56:49,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600026862] [2021-11-21 01:56:49,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 01:56:49,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:56:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:56:49,799 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:56:49,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-21 01:56:50,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 01:56:50,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:56:50,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:56:50,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:56:50,381 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-21 01:56:50,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,433 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-21 01:56:50,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,503 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-21 01:56:50,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:56:50,682 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-21 01:56:50,892 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 01:56:50,893 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-21 01:56:51,000 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-21 01:56:51,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:56:52,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) is different from false [2021-11-21 01:56:59,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) is different from false [2021-11-21 01:57:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 01:57:01,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600026862] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:57:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075902338] [2021-11-21 01:57:01,020 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-21 01:57:01,021 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:57:01,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 01:57:01,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248607318] [2021-11-21 01:57:01,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:57:01,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 01:57:01,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:57:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 01:57:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=749, Unknown=5, NotChecked=114, Total=992 [2021-11-21 01:57:01,024 INFO L87 Difference]: Start difference. First operand 6615 states and 14143 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-21 01:57:02,606 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (<= (+ |c_~#cache~0.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= (select (store .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 01:57:03,574 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (store .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |c_~#cache~0.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3)) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (select (let ((.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5)) (= (select .cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (= (select .cse1 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)))) is different from false [2021-11-21 01:57:05,940 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 01:57:06,980 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= (select .cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 01:57:13,473 WARN L227 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:57:28,429 WARN L227 SmtUtils]: Spent 9.49s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:57:29,965 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 01:57:39,785 WARN L227 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:57:41,377 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|)))) is different from false [2021-11-21 01:57:43,134 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|)))) is different from false [2021-11-21 01:58:00,882 WARN L227 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:58:09,601 WARN L227 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:58:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:58:09,756 INFO L93 Difference]: Finished difference Result 23444 states and 49023 transitions. [2021-11-21 01:58:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-21 01:58:09,757 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-21 01:58:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:58:09,863 INFO L225 Difference]: With dead ends: 23444 [2021-11-21 01:58:09,863 INFO L226 Difference]: Without dead ends: 23444 [2021-11-21 01:58:09,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 75.3s TimeCoverageRelationStatistics Valid=952, Invalid=6037, Unknown=19, NotChecked=1548, Total=8556 [2021-11-21 01:58:09,866 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 974 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 7343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3309 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:58:09,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 580 Invalid, 7343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 3887 Invalid, 0 Unknown, 3309 Unchecked, 3.3s Time] [2021-11-21 01:58:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2021-11-21 01:58:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 12855. [2021-11-21 01:58:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12855 states, 12842 states have (on average 2.179333437159321) internal successors, (27987), 12854 states have internal predecessors, (27987), 0 states have call successors, (0), 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-21 01:58:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 27987 transitions. [2021-11-21 01:58:10,307 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 27987 transitions. Word has length 45 [2021-11-21 01:58:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:58:10,307 INFO L470 AbstractCegarLoop]: Abstraction has 12855 states and 27987 transitions. [2021-11-21 01:58:10,307 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-21 01:58:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 27987 transitions. [2021-11-21 01:58:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:58:10,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:58:10,311 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-21 01:58:10,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-21 01:58:10,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-21 01:58:10,533 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:58:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:58:10,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1527646261, now seen corresponding path program 4 times [2021-11-21 01:58:10,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:58:10,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344015657] [2021-11-21 01:58:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:58:10,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:58:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:58:10,885 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-21 01:58:10,885 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:58:10,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344015657] [2021-11-21 01:58:10,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344015657] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:58:10,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736627986] [2021-11-21 01:58:10,886 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 01:58:10,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:58:10,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:58:10,887 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:58:10,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-21 01:58:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:58:11,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 01:58:11,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:58:11,408 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-21 01:58:11,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,457 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-21 01:58:11,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,554 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-21 01:58:11,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:58:11,615 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-21 01:58:11,733 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 01:58:11,734 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-21 01:58:11,802 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-21 01:58:11,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:58:19,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))))) is different from false [2021-11-21 01:58:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 01:58:21,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736627986] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:58:21,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1132226593] [2021-11-21 01:58:21,693 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-21 01:58:21,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:58:21,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 01:58:21,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387825118] [2021-11-21 01:58:21,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:58:21,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 01:58:21,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:58:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 01:58:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=4, NotChecked=58, Total=992 [2021-11-21 01:58:21,696 INFO L87 Difference]: Start difference. First operand 12855 states and 27987 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-21 01:58:23,496 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |c_~#cache~0.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= (select (store .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 01:58:26,362 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 01:58:38,035 WARN L227 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:58:52,213 WARN L227 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:58:53,620 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (select (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5)) (= (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse6)) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= (select .cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)))) is different from false [2021-11-21 01:59:02,641 WARN L227 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:59:04,371 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))))))))) is different from false [2021-11-21 01:59:19,190 WARN L227 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 01:59:20,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))) (and (< |c_ULTIMATE.start_main_~i~2#1| .cse0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247|) (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_247| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= (select .cse1 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)))))))) (< 0 .cse0))) is different from false [2021-11-21 01:59:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:59:20,454 INFO L93 Difference]: Finished difference Result 40326 states and 86834 transitions. [2021-11-21 01:59:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-21 01:59:20,455 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-21 01:59:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:59:20,537 INFO L225 Difference]: With dead ends: 40326 [2021-11-21 01:59:20,538 INFO L226 Difference]: Without dead ends: 40326 [2021-11-21 01:59:20,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2413 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=1168, Invalid=6317, Unknown=21, NotChecked=1050, Total=8556 [2021-11-21 01:59:20,541 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 1020 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 3880 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 6763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 3880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2573 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:59:20,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1020 Valid, 486 Invalid, 6763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 3880 Invalid, 0 Unknown, 2573 Unchecked, 3.6s Time] [2021-11-21 01:59:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40326 states. [2021-11-21 01:59:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40326 to 25531. [2021-11-21 01:59:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25531 states, 25518 states have (on average 2.2040520416960576) internal successors, (56243), 25530 states have internal predecessors, (56243), 0 states have call successors, (0), 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-21 01:59:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25531 states to 25531 states and 56243 transitions. [2021-11-21 01:59:21,676 INFO L78 Accepts]: Start accepts. Automaton has 25531 states and 56243 transitions. Word has length 45 [2021-11-21 01:59:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:59:21,676 INFO L470 AbstractCegarLoop]: Abstraction has 25531 states and 56243 transitions. [2021-11-21 01:59:21,677 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-21 01:59:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25531 states and 56243 transitions. [2021-11-21 01:59:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:59:21,697 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:59:21,698 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-21 01:59:21,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-21 01:59:21,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:21,917 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:59:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:59:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1517537279, now seen corresponding path program 5 times [2021-11-21 01:59:21,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:59:21,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449303288] [2021-11-21 01:59:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:59:21,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:59:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:59:22,436 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-21 01:59:22,436 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:59:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449303288] [2021-11-21 01:59:22,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449303288] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:59:22,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782876252] [2021-11-21 01:59:22,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:59:22,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:22,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:59:22,441 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:59:22,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-21 01:59:22,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 01:59:22,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:59:22,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 01:59:22,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:59:22,685 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-21 01:59:22,849 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-21 01:59:22,914 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-21 01:59:22,914 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-21 01:59:22,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:22,975 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-21 01:59:23,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,048 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-21 01:59:23,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:23,138 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-21 01:59:23,303 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-21 01:59:23,304 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-21 01:59:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-21 01:59:23,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:59:23,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:23,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:24,287 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-21 01:59:24,290 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-21 01:59:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-21 01:59:24,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782876252] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 01:59:24,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-21 01:59:24,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-21 01:59:24,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304434064] [2021-11-21 01:59:24,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:59:24,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 01:59:24,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:59:24,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 01:59:24,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-11-21 01:59:24,339 INFO L87 Difference]: Start difference. First operand 25531 states and 56243 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-21 01:59:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:59:28,793 INFO L93 Difference]: Finished difference Result 29667 states and 65022 transitions. [2021-11-21 01:59:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 01:59:28,794 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-21 01:59:28,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:59:28,850 INFO L225 Difference]: With dead ends: 29667 [2021-11-21 01:59:28,850 INFO L226 Difference]: Without dead ends: 29667 [2021-11-21 01:59:28,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2021-11-21 01:59:28,852 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:59:28,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 33 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-11-21 01:59:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29667 states. [2021-11-21 01:59:29,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29667 to 25754. [2021-11-21 01:59:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25754 states, 25741 states have (on average 2.2022842935394897) internal successors, (56689), 25753 states have internal predecessors, (56689), 0 states have call successors, (0), 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-21 01:59:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25754 states to 25754 states and 56689 transitions. [2021-11-21 01:59:29,557 INFO L78 Accepts]: Start accepts. Automaton has 25754 states and 56689 transitions. Word has length 45 [2021-11-21 01:59:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:59:29,558 INFO L470 AbstractCegarLoop]: Abstraction has 25754 states and 56689 transitions. [2021-11-21 01:59:29,558 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-21 01:59:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25754 states and 56689 transitions. [2021-11-21 01:59:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:59:29,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:59:29,562 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-21 01:59:29,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-21 01:59:29,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:29,777 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:59:29,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:59:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1517924159, now seen corresponding path program 6 times [2021-11-21 01:59:29,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:59:29,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678290681] [2021-11-21 01:59:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:59:29,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:59:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:59:30,086 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-21 01:59:30,087 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:59:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678290681] [2021-11-21 01:59:30,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678290681] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:59:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43481960] [2021-11-21 01:59:30,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 01:59:30,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:30,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:59:30,089 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:59:30,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-21 01:59:30,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 01:59:30,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:59:30,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 01:59:30,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:59:31,043 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-21 01:59:31,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,150 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-21 01:59:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,215 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-21 01:59:31,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,316 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-21 01:59:31,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:31,390 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-21 01:59:31,445 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-21 01:59:31,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:59:31,789 INFO L354 Elim1Store]: treesize reduction 222, result has 16.2 percent of original size [2021-11-21 01:59:31,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 57 [2021-11-21 01:59:31,801 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 65 treesize of output 53 [2021-11-21 01:59:31,808 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-21 01:59:31,808 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 60 treesize of output 42 [2021-11-21 01:59:31,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,866 INFO L354 Elim1Store]: treesize reduction 109, result has 28.3 percent of original size [2021-11-21 01:59:31,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 57 [2021-11-21 01:59:31,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2021-11-21 01:59:31,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,879 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 42 treesize of output 26 [2021-11-21 01:59:31,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,887 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,921 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-21 01:59:31,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 57 [2021-11-21 01:59:31,936 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 01:59:31,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2021-11-21 01:59:31,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:31,952 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-21 01:59:31,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2021-11-21 01:59:32,238 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-21 01:59:32,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43481960] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:59:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1010049620] [2021-11-21 01:59:32,238 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-21 01:59:32,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:59:32,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-21 01:59:32,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621790518] [2021-11-21 01:59:32,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:59:32,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-21 01:59:32,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:59:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-21 01:59:32,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2021-11-21 01:59:32,241 INFO L87 Difference]: Start difference. First operand 25754 states and 56689 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:59:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:59:40,570 INFO L93 Difference]: Finished difference Result 31557 states and 68347 transitions. [2021-11-21 01:59:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-21 01:59:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-21 01:59:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:59:40,687 INFO L225 Difference]: With dead ends: 31557 [2021-11-21 01:59:40,687 INFO L226 Difference]: Without dead ends: 31557 [2021-11-21 01:59:40,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2021-11-21 01:59:40,689 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 735 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 3995 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 3995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:59:40,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 364 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 3995 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2021-11-21 01:59:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31557 states. [2021-11-21 01:59:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31557 to 25794. [2021-11-21 01:59:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25794 states, 25781 states have (on average 2.2020480198595864) internal successors, (56771), 25793 states have internal predecessors, (56771), 0 states have call successors, (0), 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-21 01:59:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25794 states to 25794 states and 56771 transitions. [2021-11-21 01:59:41,395 INFO L78 Accepts]: Start accepts. Automaton has 25794 states and 56771 transitions. Word has length 45 [2021-11-21 01:59:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:59:41,395 INFO L470 AbstractCegarLoop]: Abstraction has 25794 states and 56771 transitions. [2021-11-21 01:59:41,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:59:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25794 states and 56771 transitions. [2021-11-21 01:59:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:59:41,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:59:41,399 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-21 01:59:41,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-21 01:59:41,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-21 01:59:41,600 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:59:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:59:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1069772857, now seen corresponding path program 2 times [2021-11-21 01:59:41,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:59:41,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147631085] [2021-11-21 01:59:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:59:41,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:59:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:59:41,945 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-21 01:59:41,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:59:41,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147631085] [2021-11-21 01:59:41,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147631085] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:59:41,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999699027] [2021-11-21 01:59:41,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:59:41,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:59:41,947 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:59:41,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-21 01:59:42,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 01:59:42,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:59:42,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-21 01:59:42,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:59:42,523 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-21 01:59:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,566 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-21 01:59:42,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,616 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-21 01:59:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,686 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-21 01:59:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:42,791 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-21 01:59:42,791 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 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-21 01:59:42,869 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-21 01:59:42,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:59:43,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 01:59:43,686 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-21 01:59:43,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999699027] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:59:43,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185569276] [2021-11-21 01:59:43,687 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-21 01:59:43,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:59:43,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 01:59:43,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969769632] [2021-11-21 01:59:43,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:59:43,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 01:59:43,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:59:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 01:59:43,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-21 01:59:43,689 INFO L87 Difference]: Start difference. First operand 25794 states and 56771 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-21 01:59:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:59:47,524 INFO L93 Difference]: Finished difference Result 46667 states and 102366 transitions. [2021-11-21 01:59:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-21 01:59:47,525 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-21 01:59:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:59:47,608 INFO L225 Difference]: With dead ends: 46667 [2021-11-21 01:59:47,609 INFO L226 Difference]: Without dead ends: 46667 [2021-11-21 01:59:47,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=659, Invalid=2311, Unknown=0, NotChecked=0, Total=2970 [2021-11-21 01:59:47,610 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 1208 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-21 01:59:47,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 257 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 3153 Invalid, 0 Unknown, 46 Unchecked, 2.8s Time] [2021-11-21 01:59:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46667 states. [2021-11-21 01:59:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46667 to 32267. [2021-11-21 01:59:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32267 states, 32254 states have (on average 2.220127736094748) internal successors, (71608), 32266 states have internal predecessors, (71608), 0 states have call successors, (0), 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-21 01:59:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32267 states to 32267 states and 71608 transitions. [2021-11-21 01:59:48,449 INFO L78 Accepts]: Start accepts. Automaton has 32267 states and 71608 transitions. Word has length 45 [2021-11-21 01:59:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:59:48,449 INFO L470 AbstractCegarLoop]: Abstraction has 32267 states and 71608 transitions. [2021-11-21 01:59:48,449 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-21 01:59:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32267 states and 71608 transitions. [2021-11-21 01:59:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 01:59:48,452 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:59:48,452 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-21 01:59:48,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-21 01:59:48,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-21 01:59:48,653 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 01:59:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:59:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -301776767, now seen corresponding path program 2 times [2021-11-21 01:59:48,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:59:48,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74506819] [2021-11-21 01:59:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:59:48,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:59:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:59:48,839 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-21 01:59:48,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:59:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74506819] [2021-11-21 01:59:48,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74506819] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:59:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132024316] [2021-11-21 01:59:48,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 01:59:48,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:59:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:59:48,845 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:59:48,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-21 01:59:48,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 01:59:48,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 01:59:48,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 01:59:48,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:59:49,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, 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-21 01:59:49,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,238 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-21 01:59:49,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,266 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-21 01:59:49,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,323 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:59:49,323 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-21 01:59:49,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:59:49,371 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 01:59:49,371 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-21 01:59:49,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-21 01:59:49,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:59:51,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 01:59:51,508 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 01:59:51,508 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-21 01:59:51,511 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-21 01:59:51,514 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-21 01:59:51,707 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-21 01:59:51,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132024316] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:59:51,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1549184830] [2021-11-21 01:59:51,707 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-21 01:59:51,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:59:51,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-21 01:59:51,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006145334] [2021-11-21 01:59:51,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:59:51,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-21 01:59:51,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:59:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-21 01:59:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2021-11-21 01:59:51,710 INFO L87 Difference]: Start difference. First operand 32267 states and 71608 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-21 01:59:54,037 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (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_ULTIMATE.start_main_~i~2#1| 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 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 01:59:57,941 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (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) (= (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 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:01,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (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) (= (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 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:02,512 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.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) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:04,572 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (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|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:07,919 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.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) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:09,411 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (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|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:11,479 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|)) (< |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (= (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) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:14,481 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))) (and (< |c_ULTIMATE.start_main_~i~2#1| .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< 0 .cse0) (= (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|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:18,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| 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_89|)) |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-21 02:00:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:00:19,831 INFO L93 Difference]: Finished difference Result 167576 states and 370935 transitions. [2021-11-21 02:00:19,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-11-21 02:00:19,836 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-21 02:00:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:00:20,244 INFO L225 Difference]: With dead ends: 167576 [2021-11-21 02:00:20,244 INFO L226 Difference]: Without dead ends: 167576 [2021-11-21 02:00:20,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 8068 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=2639, Invalid=17986, Unknown=11, NotChecked=3234, Total=23870 [2021-11-21 02:00:20,246 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1600 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 10130 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 12153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 10130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1593 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-21 02:00:20,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1600 Valid, 573 Invalid, 12153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 10130 Invalid, 0 Unknown, 1593 Unchecked, 7.2s Time] [2021-11-21 02:00:20,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167576 states. [2021-11-21 02:00:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167576 to 81325. [2021-11-21 02:00:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81325 states, 81312 states have (on average 2.2332005116096023) internal successors, (181586), 81324 states have internal predecessors, (181586), 0 states have call successors, (0), 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-21 02:00:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81325 states to 81325 states and 181586 transitions. [2021-11-21 02:00:23,442 INFO L78 Accepts]: Start accepts. Automaton has 81325 states and 181586 transitions. Word has length 45 [2021-11-21 02:00:23,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:00:23,443 INFO L470 AbstractCegarLoop]: Abstraction has 81325 states and 181586 transitions. [2021-11-21 02:00:23,443 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-21 02:00:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 81325 states and 181586 transitions. [2021-11-21 02:00:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:00:23,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:00:23,447 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-21 02:00:23,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-21 02:00:23,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-21 02:00:23,655 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:00:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:00:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -349144457, now seen corresponding path program 3 times [2021-11-21 02:00:23,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:00:23,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638324712] [2021-11-21 02:00:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:00:23,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:00:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:00:24,163 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-21 02:00:24,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:00:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638324712] [2021-11-21 02:00:24,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638324712] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:00:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299688619] [2021-11-21 02:00:24,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 02:00:24,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:00:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:00:24,165 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:00:24,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-21 02:00:24,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 02:00:24,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:00:24,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-21 02:00:24,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:00:24,805 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-21 02:00:24,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,850 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-21 02:00:24,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,919 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-21 02:00:24,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:24,971 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-21 02:00:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:25,030 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-21 02:00:25,071 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-21 02:00:25,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:00:25,329 INFO L354 Elim1Store]: treesize reduction 83, result has 25.9 percent of original size [2021-11-21 02:00:25,330 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 43 [2021-11-21 02:00:25,333 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 33 treesize of output 29 [2021-11-21 02:00:25,338 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-21 02:00:25,338 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 40 treesize of output 34 [2021-11-21 02:00:25,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:25,381 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-21 02:00:25,382 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-21 02:00:25,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2021-11-21 02:00:25,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:25,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:25,391 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 22 treesize of output 16 [2021-11-21 02:00:25,730 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-21 02:00:25,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299688619] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:00:25,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770826897] [2021-11-21 02:00:25,731 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-21 02:00:25,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:00:25,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-21 02:00:25,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333915582] [2021-11-21 02:00:25,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:00:25,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-21 02:00:25,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:00:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-21 02:00:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-21 02:00:25,733 INFO L87 Difference]: Start difference. First operand 81325 states and 181586 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:00:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:00:32,387 INFO L93 Difference]: Finished difference Result 110828 states and 245438 transitions. [2021-11-21 02:00:32,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-21 02:00:32,387 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-21 02:00:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:00:32,639 INFO L225 Difference]: With dead ends: 110828 [2021-11-21 02:00:32,639 INFO L226 Difference]: Without dead ends: 110828 [2021-11-21 02:00:32,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 75 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2421 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1401, Invalid=5405, Unknown=0, NotChecked=0, Total=6806 [2021-11-21 02:00:32,640 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 961 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 5942 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 6932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 5942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-21 02:00:32,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 404 Invalid, 6932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 5942 Invalid, 0 Unknown, 704 Unchecked, 4.2s Time] [2021-11-21 02:00:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110828 states. [2021-11-21 02:00:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110828 to 33225. [2021-11-21 02:00:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33225 states, 33212 states have (on average 2.2187161267011923) internal successors, (73688), 33224 states have internal predecessors, (73688), 0 states have call successors, (0), 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-21 02:00:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33225 states to 33225 states and 73688 transitions. [2021-11-21 02:00:34,225 INFO L78 Accepts]: Start accepts. Automaton has 33225 states and 73688 transitions. Word has length 45 [2021-11-21 02:00:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:00:34,225 INFO L470 AbstractCegarLoop]: Abstraction has 33225 states and 73688 transitions. [2021-11-21 02:00:34,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:00:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 33225 states and 73688 transitions. [2021-11-21 02:00:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:00:34,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:00:34,228 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-21 02:00:34,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-21 02:00:34,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:00:34,453 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-21 02:00:34,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:00:34,453 INFO L85 PathProgramCache]: Analyzing trace with hash -484149272, now seen corresponding path program 2 times [2021-11-21 02:00:34,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:00:34,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777286715] [2021-11-21 02:00:34,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:00:34,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:00:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:00:35,106 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-21 02:00:35,107 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:00:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777286715] [2021-11-21 02:00:35,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777286715] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:00:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951195901] [2021-11-21 02:00:35,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 02:00:35,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:00:35,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:00:35,110 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:00:35,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-21 02:00:35,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 02:00:35,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:00:35,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-21 02:00:35,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:00:35,562 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-21 02:00:35,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,621 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-21 02:00:35,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,675 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-21 02:00:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,751 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-21 02:00:35,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,854 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-21 02:00:35,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:35,975 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-21 02:00:36,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,152 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-21 02:00:36,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,304 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-21 02:00:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:00:36,753 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 02:00:36,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-21 02:00:48,871 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-21 02:00:48,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:00:51,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:00:51,497 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-21 02:00:51,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951195901] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:00:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097219739] [2021-11-21 02:00:51,498 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-21 02:00:51,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:00:51,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 02:00:51,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514830252] [2021-11-21 02:00:51,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:00:51,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 02:00:51,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:00:51,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 02:00:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1266, Unknown=5, NotChecked=0, Total=1560 [2021-11-21 02:00:51,501 INFO L87 Difference]: Start difference. First operand 33225 states and 73688 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-21 02:01:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:01:22,268 INFO L93 Difference]: Finished difference Result 52348 states and 114261 transitions. [2021-11-21 02:01:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-21 02:01:22,269 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-21 02:01:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:01:22,369 INFO L225 Difference]: With dead ends: 52348 [2021-11-21 02:01:22,369 INFO L226 Difference]: Without dead ends: 52348 [2021-11-21 02:01:22,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1800 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=1217, Invalid=4619, Unknown=16, NotChecked=0, Total=5852 [2021-11-21 02:01:22,370 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 974 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 6486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2445 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-21 02:01:22,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 311 Invalid, 6486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 3831 Invalid, 0 Unknown, 2445 Unchecked, 2.6s Time] [2021-11-21 02:01:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52348 states. [2021-11-21 02:01:23,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52348 to 34238. [2021-11-21 02:01:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34238 states, 34225 states have (on average 2.2116289262235207) internal successors, (75693), 34237 states have internal predecessors, (75693), 0 states have call successors, (0), 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-21 02:01:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34238 states to 34238 states and 75693 transitions. [2021-11-21 02:01:23,172 INFO L78 Accepts]: Start accepts. Automaton has 34238 states and 75693 transitions. Word has length 45 [2021-11-21 02:01:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:01:23,172 INFO L470 AbstractCegarLoop]: Abstraction has 34238 states and 75693 transitions. [2021-11-21 02:01:23,173 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-21 02:01:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 34238 states and 75693 transitions. [2021-11-21 02:01:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:01:23,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:01:23,175 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-21 02:01:23,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-21 02:01:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:01:23,389 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:01:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:01:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 679382453, now seen corresponding path program 7 times [2021-11-21 02:01:23,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:01:23,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357755409] [2021-11-21 02:01:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:01:23,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:01:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:01:23,730 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-21 02:01:23,730 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:01:23,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357755409] [2021-11-21 02:01:23,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357755409] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:01:23,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722404078] [2021-11-21 02:01:23,731 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 02:01:23,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:01:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:01:23,737 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:01:23,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-21 02:01:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:01:23,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 02:01:23,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:01:24,165 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-21 02:01:24,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,201 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-21 02:01:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,249 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-21 02:01:24,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:24,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-21 02:01:24,449 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 02:01:24,449 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-21 02:01:24,539 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-21 02:01:24,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:01:24,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:24,838 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:01:25,260 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-21 02:01:25,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722404078] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:01:25,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1254570881] [2021-11-21 02:01:25,261 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-21 02:01:25,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:01:25,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 02:01:25,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971344682] [2021-11-21 02:01:25,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:01:25,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 02:01:25,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:01:25,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 02:01:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2021-11-21 02:01:25,263 INFO L87 Difference]: Start difference. First operand 34238 states and 75693 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-21 02:01:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:01:34,229 INFO L93 Difference]: Finished difference Result 49795 states and 107980 transitions. [2021-11-21 02:01:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-21 02:01:34,230 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-21 02:01:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:01:34,335 INFO L225 Difference]: With dead ends: 49795 [2021-11-21 02:01:34,336 INFO L226 Difference]: Without dead ends: 49795 [2021-11-21 02:01:34,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2245, Invalid=9097, Unknown=0, NotChecked=0, Total=11342 [2021-11-21 02:01:34,338 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1175 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 5859 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 6420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 5859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-11-21 02:01:34,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1175 Valid, 410 Invalid, 6420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 5859 Invalid, 0 Unknown, 287 Unchecked, 5.7s Time] [2021-11-21 02:01:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49795 states. [2021-11-21 02:01:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49795 to 37355. [2021-11-21 02:01:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37355 states, 37342 states have (on average 2.1934283112848805) internal successors, (81907), 37354 states have internal predecessors, (81907), 0 states have call successors, (0), 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-21 02:01:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37355 states to 37355 states and 81907 transitions. [2021-11-21 02:01:35,104 INFO L78 Accepts]: Start accepts. Automaton has 37355 states and 81907 transitions. Word has length 45 [2021-11-21 02:01:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:01:35,104 INFO L470 AbstractCegarLoop]: Abstraction has 37355 states and 81907 transitions. [2021-11-21 02:01:35,104 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-21 02:01:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37355 states and 81907 transitions. [2021-11-21 02:01:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:01:35,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:01:35,107 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-21 02:01:35,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-21 02:01:35,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-21 02:01:35,326 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-21 02:01:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:01:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash 911917160, now seen corresponding path program 3 times [2021-11-21 02:01:35,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:01:35,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567712411] [2021-11-21 02:01:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:01:35,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:01:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:01:35,919 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-21 02:01:35,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:01:35,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567712411] [2021-11-21 02:01:35,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567712411] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:01:35,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782890833] [2021-11-21 02:01:35,921 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 02:01:35,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:01:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:01:35,922 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:01:35,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-21 02:01:36,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 02:01:36,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:01:36,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-21 02:01:36,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:01:36,441 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-21 02:01:36,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,541 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-21 02:01:36,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,589 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-21 02:01:36,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,807 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-21 02:01:36,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,879 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-21 02:01:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:36,963 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-21 02:01:37,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,069 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-21 02:01:37,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,179 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-21 02:01:37,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:01:37,437 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 02:01:37,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-21 02:01:49,551 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-21 02:01:49,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:01:54,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-21 02:01:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 02:01:54,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782890833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:01:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375292346] [2021-11-21 02:01:54,388 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-21 02:01:54,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:01:54,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 02:01:54,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279781642] [2021-11-21 02:01:54,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:01:54,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 02:01:54,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:01:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 02:01:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1223, Unknown=6, NotChecked=74, Total=1560 [2021-11-21 02:01:54,390 INFO L87 Difference]: Start difference. First operand 37355 states and 81907 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-21 02:01:57,118 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= (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_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 02:02:24,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= |c_~#cache~0.offset| 0) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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 (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) .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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (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|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (select (select (let ((.cse7 (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 .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 02:02:37,512 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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 (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) .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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (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|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (select (select (let ((.cse7 (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 .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-21 02:02:39,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| 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 (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) .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_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse3 (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|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse5 (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) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167| Int)) (= (select (select (let ((.cse7 (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 .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_167|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_518| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-21 02:02:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:02:40,621 INFO L93 Difference]: Finished difference Result 108652 states and 235567 transitions. [2021-11-21 02:02:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-21 02:02:40,622 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-21 02:02:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:02:40,855 INFO L225 Difference]: With dead ends: 108652 [2021-11-21 02:02:40,855 INFO L226 Difference]: Without dead ends: 108652 [2021-11-21 02:02:40,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=980, Invalid=5658, Unknown=24, NotChecked=820, Total=7482 [2021-11-21 02:02:40,856 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 510 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 4400 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 6055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1538 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-21 02:02:40,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 726 Invalid, 6055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4400 Invalid, 0 Unknown, 1538 Unchecked, 3.2s Time] [2021-11-21 02:02:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108652 states. [2021-11-21 02:02:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108652 to 79649. [2021-11-21 02:02:42,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79649 states, 79636 states have (on average 2.189072781154252) internal successors, (174329), 79648 states have internal predecessors, (174329), 0 states have call successors, (0), 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-21 02:02:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79649 states to 79649 states and 174329 transitions. [2021-11-21 02:02:42,956 INFO L78 Accepts]: Start accepts. Automaton has 79649 states and 174329 transitions. Word has length 45 [2021-11-21 02:02:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:02:42,956 INFO L470 AbstractCegarLoop]: Abstraction has 79649 states and 174329 transitions. [2021-11-21 02:02:42,956 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-21 02:02:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 79649 states and 174329 transitions. [2021-11-21 02:02:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:02:42,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:02:42,958 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-21 02:02:42,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-21 02:02:43,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-21 02:02:43,159 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-21 02:02:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:02:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -864126232, now seen corresponding path program 4 times [2021-11-21 02:02:43,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:02:43,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176581170] [2021-11-21 02:02:43,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:02:43,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:02:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:02:44,284 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-21 02:02:44,284 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:02:44,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176581170] [2021-11-21 02:02:44,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176581170] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:02:44,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649067560] [2021-11-21 02:02:44,285 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 02:02:44,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:02:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:02:44,286 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:02:44,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-21 02:02:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:02:44,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-21 02:02:44,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:02:44,660 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-21 02:02:44,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,761 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-21 02:02:44,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,812 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-21 02:02:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-21 02:02:44,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:44,959 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-21 02:02:45,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,050 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-21 02:02:45,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,150 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-21 02:02:45,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,273 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-21 02:02:45,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:02:45,556 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 02:02:45,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-21 02:02:55,680 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-21 02:02:55,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:03:01,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (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|) (+ |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 .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |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_172| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (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) .cse6 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-21 02:03:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 02:03:01,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649067560] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:03:01,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1685059712] [2021-11-21 02:03:01,585 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-21 02:03:01,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:03:01,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 02:03:01,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277772414] [2021-11-21 02:03:01,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:03:01,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 02:03:01,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:03:01,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 02:03:01,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1233, Unknown=5, NotChecked=74, Total=1560 [2021-11-21 02:03:01,587 INFO L87 Difference]: Start difference. First operand 79649 states and 174329 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-21 02:03:04,212 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (= (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_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (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|) (+ |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 .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |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_172| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (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) .cse6 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 02:03:18,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= |c_~#cache~0.offset| 0) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (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 .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |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_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) .cse7 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 02:03:22,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (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 .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |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_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) .cse7 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-21 02:03:24,340 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (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 .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |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_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) .cse7 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_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-21 02:03:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:03:25,177 INFO L93 Difference]: Finished difference Result 108980 states and 235926 transitions. [2021-11-21 02:03:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-21 02:03:25,178 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-21 02:03:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:03:25,393 INFO L225 Difference]: With dead ends: 108980 [2021-11-21 02:03:25,393 INFO L226 Difference]: Without dead ends: 108980 [2021-11-21 02:03:25,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2371 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=1049, Invalid=6267, Unknown=14, NotChecked=860, Total=8190 [2021-11-21 02:03:25,394 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 592 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 4194 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 7151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 4194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2827 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-21 02:03:25,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 669 Invalid, 7151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 4194 Invalid, 0 Unknown, 2827 Unchecked, 2.7s Time] [2021-11-21 02:03:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108980 states. [2021-11-21 02:03:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108980 to 78862. [2021-11-21 02:03:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78862 states, 78849 states have (on average 2.1888419637535037) internal successors, (172588), 78861 states have internal predecessors, (172588), 0 states have call successors, (0), 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-21 02:03:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78862 states to 78862 states and 172588 transitions. [2021-11-21 02:03:27,661 INFO L78 Accepts]: Start accepts. Automaton has 78862 states and 172588 transitions. Word has length 45 [2021-11-21 02:03:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:03:27,661 INFO L470 AbstractCegarLoop]: Abstraction has 78862 states and 172588 transitions. [2021-11-21 02:03:27,661 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-21 02:03:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 78862 states and 172588 transitions. [2021-11-21 02:03:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:03:27,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:03:27,665 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-21 02:03:27,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-21 02:03:27,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:03:27,869 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-21 02:03:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:03:27,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1650573526, now seen corresponding path program 5 times [2021-11-21 02:03:27,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:03:27,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026888977] [2021-11-21 02:03:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:03:27,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:03:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:03:28,468 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-21 02:03:28,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:03:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026888977] [2021-11-21 02:03:28,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026888977] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:03:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351423921] [2021-11-21 02:03:28,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 02:03:28,469 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:03:28,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:03:28,470 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:03:28,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-21 02:03:28,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 02:03:28,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:03:28,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-21 02:03:28,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:03:28,861 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-21 02:03:28,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:28,954 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-21 02:03:29,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,008 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-21 02:03:29,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,097 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-21 02:03:29,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,193 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-21 02:03:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,304 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-21 02:03:29,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,718 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-21 02:03:29,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:29,844 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-21 02:03:30,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:03:30,100 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 02:03:30,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-21 02:03:40,256 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-21 02:03:40,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:03:45,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |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_177| 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 (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) .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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (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|) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-21 02:03:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 02:03:45,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351423921] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:03:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389893594] [2021-11-21 02:03:45,878 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-21 02:03:45,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 02:03:45,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 02:03:45,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526300078] [2021-11-21 02:03:45,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 02:03:45,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 02:03:45,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:03:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 02:03:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1234, Unknown=5, NotChecked=74, Total=1560 [2021-11-21 02:03:45,880 INFO L87 Difference]: Start difference. First operand 78862 states and 172588 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-21 02:03:48,711 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (= (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_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |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_177| 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 (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) .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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (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) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (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|) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 02:04:52,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (select (select (let ((.cse1 (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 .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |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_177| 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 (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) .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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 02:04:57,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (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_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (select (select (let ((.cse1 (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 .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |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_177| 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 (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) .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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-21 02:04:59,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (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_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (select (select (let ((.cse1 (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 .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |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_177| 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 (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) .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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse5 0) (+ |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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 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_522| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_177|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_522| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-21 02:04:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:04:59,700 INFO L93 Difference]: Finished difference Result 141473 states and 307144 transitions. [2021-11-21 02:04:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-21 02:04:59,700 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-21 02:04:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:00,238 INFO L225 Difference]: With dead ends: 141473 [2021-11-21 02:05:00,238 INFO L226 Difference]: Without dead ends: 141473 [2021-11-21 02:05:00,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 103 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3695 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=1849, Invalid=8039, Unknown=32, NotChecked=1000, Total=10920 [2021-11-21 02:05:00,240 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 792 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 4947 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 9531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 4947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4441 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:00,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 690 Invalid, 9531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 4947 Invalid, 0 Unknown, 4441 Unchecked, 3.4s Time] [2021-11-21 02:05:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141473 states. [2021-11-21 02:05:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141473 to 79580. [2021-11-21 02:05:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79580 states, 79567 states have (on average 2.187753716993226) internal successors, (174073), 79579 states have internal predecessors, (174073), 0 states have call successors, (0), 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-21 02:05:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79580 states to 79580 states and 174073 transitions. [2021-11-21 02:05:02,957 INFO L78 Accepts]: Start accepts. Automaton has 79580 states and 174073 transitions. Word has length 45 [2021-11-21 02:05:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:02,957 INFO L470 AbstractCegarLoop]: Abstraction has 79580 states and 174073 transitions. [2021-11-21 02:05:02,957 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-21 02:05:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 79580 states and 174073 transitions. [2021-11-21 02:05:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:05:02,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:02,959 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-21 02:05:02,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:03,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-21 02:05:03,161 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:03,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1810078702, now seen corresponding path program 6 times [2021-11-21 02:05:03,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 02:05:03,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465181836] [2021-11-21 02:05:03,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:03,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 02:05:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:03,677 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-21 02:05:03,678 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 02:05:03,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465181836] [2021-11-21 02:05:03,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465181836] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 02:05:03,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249690848] [2021-11-21 02:05:03,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 02:05:03,678 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:05:03,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:05:03,679 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:05:03,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-21 02:05:03,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 02:05:03,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:05:03,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-21 02:05:03,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:04,229 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-21 02:05:04,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,327 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-21 02:05:04,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,371 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-21 02:05:04,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,438 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-21 02:05:04,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,515 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-21 02:05:04,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,595 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-21 02:05:04,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,693 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-21 02:05:04,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:04,932 INFO L354 Elim1Store]: treesize reduction 475, result has 11.5 percent of original size [2021-11-21 02:05:04,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 97 treesize of output 103 [2021-11-21 02:05:15,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:05:15,101 INFO L354 Elim1Store]: treesize reduction 288, result has 11.4 percent of original size [2021-11-21 02:05:15,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 98 [2021-11-21 02:05:17,469 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-21 02:05:17,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:29,249 INFO L354 Elim1Store]: treesize reduction 2816, result has 8.4 percent of original size [2021-11-21 02:05:29,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 21 case distinctions, treesize of input 226 treesize of output 305 [2021-11-21 02:05:29,260 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 02:05:29,261 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 305 treesize of output 295 [2021-11-21 02:05:29,283 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 02:05:29,284 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 295 treesize of output 285 [2021-11-21 02:05:29,292 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-21 02:05:29,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1026048979] [2021-11-21 02:05:29,293 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-21 02:05:29,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-21 02:05:29,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-21 02:05:29,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652085440] [2021-11-21 02:05:29,294 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-21 02:05:29,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 02:05:29,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 02:05:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 02:05:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=992, Unknown=7, NotChecked=0, Total=1190 [2021-11-21 02:05:29,296 INFO L87 Difference]: Start difference. First operand 79580 states and 174073 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 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-21 02:05:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 02:05:29,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=191, Invalid=992, Unknown=7, NotChecked=0, Total=1190 [2021-11-21 02:05:29,297 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:29,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 02:05:29,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:29,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:05:29,521 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36e73070 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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-21 02:05:29,522 INFO L158 Benchmark]: Toolchain (without parser) took 624024.67ms. Allocated memory was 88.1MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 46.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2021-11-21 02:05:29,522 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 02:05:29,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.75ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 46.5MB in the beginning and 83.6MB in the end (delta: -37.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2021-11-21 02:05:29,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.20ms. Allocated memory is still 125.8MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 02:05:29,523 INFO L158 Benchmark]: Boogie Preprocessor took 74.99ms. Allocated memory is still 125.8MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 02:05:29,523 INFO L158 Benchmark]: RCFGBuilder took 643.80ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 62.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-21 02:05:29,523 INFO L158 Benchmark]: TraceAbstraction took 622517.76ms. Allocated memory was 125.8MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 61.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2021-11-21 02:05:29,524 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 88.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.75ms. Allocated memory was 88.1MB in the beginning and 125.8MB in the end (delta: 37.7MB). Free memory was 46.5MB in the beginning and 83.6MB in the end (delta: -37.0MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.20ms. Allocated memory is still 125.8MB. Free memory was 82.8MB in the beginning and 80.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.99ms. Allocated memory is still 125.8MB. Free memory was 80.7MB in the beginning and 78.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.80ms. Allocated memory is still 125.8MB. Free memory was 78.6MB in the beginning and 62.7MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 622517.76ms. Allocated memory was 125.8MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 61.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 126 PlacesBefore, 57 PlacesAfterwards, 128 TransitionsBefore, 56 TransitionsAfterwards, 4864 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 75 TotalNumberOfCompositions, 16173 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5852, positive: 5346, positive conditional: 0, positive unconditional: 5346, negative: 506, negative conditional: 0, negative unconditional: 506, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3125, positive: 3012, positive conditional: 0, positive unconditional: 3012, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3125, positive: 2911, positive conditional: 0, positive unconditional: 2911, negative: 214, negative conditional: 0, negative unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 214, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 596, positive: 265, positive conditional: 0, positive unconditional: 265, negative: 332, negative conditional: 0, negative unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5852, positive: 2334, positive conditional: 0, positive unconditional: 2334, negative: 393, negative conditional: 0, negative unconditional: 393, unknown: 3125, unknown conditional: 0, unknown unconditional: 3125] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 528, Positive conditional cache size: 0, Positive unconditional cache size: 528, Negative cache size: 81, Negative conditional cache size: 0, Negative unconditional cache size: 81 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36e73070 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@36e73070: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-21 02:05:29,740 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-21 02:05:29,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 02:05:32,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 02:05:32,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 02:05:32,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 02:05:32,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 02:05:32,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 02:05:32,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 02:05:32,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 02:05:32,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 02:05:32,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 02:05:32,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 02:05:32,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 02:05:32,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 02:05:32,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 02:05:32,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 02:05:32,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 02:05:32,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 02:05:32,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 02:05:32,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 02:05:32,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 02:05:32,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 02:05:32,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 02:05:32,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 02:05:32,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 02:05:32,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 02:05:32,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 02:05:32,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 02:05:32,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 02:05:32,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 02:05:32,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 02:05:32,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 02:05:32,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 02:05:32,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 02:05:32,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 02:05:32,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 02:05:32,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 02:05:32,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 02:05:32,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 02:05:32,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 02:05:32,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 02:05:32,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 02:05:32,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf [2021-11-21 02:05:32,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 02:05:32,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 02:05:32,333 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 02:05:32,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 02:05:32,334 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 02:05:32,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 02:05:32,335 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 02:05:32,335 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 02:05:32,335 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 02:05:32,336 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 02:05:32,337 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 02:05:32,337 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 02:05:32,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 02:05:32,339 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 02:05:32,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 02:05:32,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 02:05:32,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 02:05:32,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 02:05:32,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 02:05:32,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 02:05:32,340 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-21 02:05:32,341 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 02:05:32,341 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 02:05:32,341 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 02:05:32,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 02:05:32,341 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 02:05:32,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 02:05:32,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 02:05:32,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 02:05:32,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 02:05:32,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 02:05:32,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 02:05:32,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 02:05:32,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 02:05:32,344 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 02:05:32,344 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 02:05:32,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 02:05:32,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 02:05:32,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 02:05:32,345 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2021-11-21 02:05:32,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 02:05:32,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 02:05:32,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 02:05:32,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 02:05:32,796 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 02:05:32,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-21 02:05:32,870 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/71d690e0d/31b0d9c3df5d471981a3c83d0698474f/FLAGfc6a57bcc [2021-11-21 02:05:33,604 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 02:05:33,605 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-21 02:05:33,629 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/71d690e0d/31b0d9c3df5d471981a3c83d0698474f/FLAGfc6a57bcc [2021-11-21 02:05:33,834 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/data/71d690e0d/31b0d9c3df5d471981a3c83d0698474f [2021-11-21 02:05:33,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 02:05:33,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 02:05:33,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 02:05:33,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 02:05:33,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 02:05:33,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:05:33" (1/1) ... [2021-11-21 02:05:33,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e77615c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:33, skipping insertion in model container [2021-11-21 02:05:33,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 02:05:33" (1/1) ... [2021-11-21 02:05:33,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 02:05:33,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 02:05:34,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 02:05:34,574 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 02:05:34,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 02:05:34,754 INFO L208 MainTranslator]: Completed translation [2021-11-21 02:05:34,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34 WrapperNode [2021-11-21 02:05:34,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 02:05:34,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 02:05:34,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 02:05:34,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 02:05:34,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,854 INFO L137 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 116 [2021-11-21 02:05:34,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 02:05:34,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 02:05:34,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 02:05:34,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 02:05:34,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 02:05:34,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 02:05:34,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 02:05:34,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 02:05:34,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (1/1) ... [2021-11-21 02:05:34,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 02:05:34,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:05:34,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 02:05:35,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 02:05:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-21 02:05:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 02:05:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 02:05:35,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-21 02:05:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-21 02:05:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 02:05:35,068 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-21 02:05:35,068 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-21 02:05:35,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 02:05:35,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 02:05:35,070 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-21 02:05:35,203 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 02:05:35,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 02:05:35,624 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 02:05:35,633 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 02:05:35,633 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-21 02:05:35,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:05:35 BoogieIcfgContainer [2021-11-21 02:05:35,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 02:05:35,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 02:05:35,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 02:05:35,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 02:05:35,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 02:05:33" (1/3) ... [2021-11-21 02:05:35,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eab4e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:05:35, skipping insertion in model container [2021-11-21 02:05:35,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 02:05:34" (2/3) ... [2021-11-21 02:05:35,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eab4e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 02:05:35, skipping insertion in model container [2021-11-21 02:05:35,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 02:05:35" (3/3) ... [2021-11-21 02:05:35,644 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2021-11-21 02:05:35,649 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-21 02:05:35,649 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 02:05:35,650 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-21 02:05:35,650 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-21 02:05:35,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,680 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,681 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,682 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,683 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,684 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,684 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,684 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,684 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,685 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,685 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-21 02:05:35,685 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-21 02:05:35,685 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,685 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-21 02:05:35,686 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-21 02:05:35,686 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-21 02:05:35,686 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-21 02:05:35,686 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-21 02:05:35,686 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-21 02:05:35,687 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-21 02:05:35,687 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-21 02:05:35,687 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-21 02:05:35,687 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-21 02:05:35,688 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-21 02:05:35,688 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-21 02:05:35,688 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-21 02:05:35,688 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-21 02:05:35,688 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-21 02:05:35,689 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-21 02:05:35,689 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-21 02:05:35,689 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-21 02:05:35,689 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-21 02:05:35,689 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-21 02:05:35,690 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-21 02:05:35,690 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-21 02:05:35,690 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-21 02:05:35,690 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-21 02:05:35,691 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-21 02:05:35,691 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-21 02:05:35,691 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-21 02:05:35,691 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-21 02:05:35,692 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-21 02:05:35,692 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-21 02:05:35,692 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-21 02:05:35,692 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-21 02:05:35,693 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-21 02:05:35,693 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-21 02:05:35,693 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-21 02:05:35,693 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-21 02:05:35,694 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-21 02:05:35,694 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-21 02:05:35,694 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-21 02:05:35,694 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-21 02:05:35,695 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-21 02:05:35,695 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-21 02:05:35,695 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-21 02:05:35,695 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-21 02:05:35,695 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-21 02:05:35,696 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-21 02:05:35,696 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-21 02:05:35,696 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-21 02:05:35,696 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-21 02:05:35,697 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-21 02:05:35,697 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-21 02:05:35,697 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-21 02:05:35,698 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-21 02:05:35,698 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-21 02:05:35,699 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-21 02:05:35,700 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-21 02:05:35,700 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-21 02:05:35,700 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-21 02:05:35,700 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-21 02:05:35,701 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-21 02:05:35,701 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-21 02:05:35,701 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-21 02:05:35,714 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-21 02:05:35,714 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-21 02:05:35,714 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-21 02:05:35,714 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-21 02:05:35,715 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-21 02:05:35,715 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-21 02:05:35,715 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-21 02:05:35,716 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-21 02:05:35,716 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-21 02:05:35,716 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-21 02:05:35,716 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-21 02:05:35,717 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-21 02:05:35,717 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-21 02:05:35,717 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-21 02:05:35,718 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-21 02:05:35,718 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-21 02:05:35,718 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-21 02:05:35,718 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-21 02:05:35,719 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-21 02:05:35,719 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-21 02:05:35,719 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-21 02:05:35,719 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-21 02:05:35,720 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-21 02:05:35,720 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-21 02:05:35,720 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-21 02:05:35,720 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-21 02:05:35,721 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-21 02:05:35,721 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-21 02:05:35,721 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-21 02:05:35,721 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-21 02:05:35,721 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-21 02:05:35,722 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-21 02:05:35,722 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-21 02:05:35,722 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-21 02:05:35,723 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-21 02:05:35,723 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-21 02:05:35,723 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-21 02:05:35,723 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-21 02:05:35,723 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-21 02:05:35,724 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-21 02:05:35,724 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-21 02:05:35,724 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-21 02:05:35,725 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-21 02:05:35,725 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-21 02:05:35,725 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-21 02:05:35,725 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-21 02:05:35,726 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-21 02:05:35,726 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-21 02:05:35,726 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-21 02:05:35,726 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-21 02:05:35,727 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-21 02:05:35,727 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-21 02:05:35,727 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-21 02:05:35,727 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-21 02:05:35,728 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-21 02:05:35,728 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-21 02:05:35,728 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,728 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,729 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,730 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,735 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-21 02:05:35,735 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-21 02:05:35,735 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-21 02:05:35,735 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-21 02:05:35,736 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-21 02:05:35,736 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-21 02:05:35,736 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-21 02:05:35,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 02:05:35,737 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-21 02:05:35,740 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-21 02:05:35,787 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 02:05:35,794 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-21 02:05:35,794 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-21 02:05:35,809 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-21 02:05:35,823 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 263 flow [2021-11-21 02:05:35,826 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 263 flow [2021-11-21 02:05:35,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 263 flow [2021-11-21 02:05:35,909 INFO L129 PetriNetUnfolder]: 6/128 cut-off events. [2021-11-21 02:05:35,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-21 02:05:35,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 128 events. 6/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2021-11-21 02:05:35,925 INFO L116 LiptonReduction]: Number of co-enabled transitions 4864 [2021-11-21 02:05:40,718 INFO L131 LiptonReduction]: Checked pairs total: 16315 [2021-11-21 02:05:40,719 INFO L133 LiptonReduction]: Total number of compositions: 76 [2021-11-21 02:05:40,727 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2021-11-21 02:05:40,761 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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-21 02:05:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 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-21 02:05:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 02:05:40,775 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:40,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:40,776 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1369924413, now seen corresponding path program 1 times [2021-11-21 02:05:40,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:40,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388563714] [2021-11-21 02:05:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:40,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:40,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:40,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 02:05:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:40,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 02:05:40,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:41,007 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-21 02:05:41,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:41,037 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-21 02:05:41,038 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:41,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388563714] [2021-11-21 02:05:41,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388563714] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:41,039 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:41,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-21 02:05:41,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066282517] [2021-11-21 02:05:41,042 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:41,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 02:05:41,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 02:05:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 02:05:41,080 INFO L87 Difference]: Start difference. First operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 02:05:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:41,259 INFO L93 Difference]: Finished difference Result 597 states and 1190 transitions. [2021-11-21 02:05:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 02:05:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 02:05:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:41,300 INFO L225 Difference]: With dead ends: 597 [2021-11-21 02:05:41,302 INFO L226 Difference]: Without dead ends: 597 [2021-11-21 02:05:41,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-21 02:05:41,315 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:41,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 02:05:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2021-11-21 02:05:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2021-11-21 02:05:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 583 states have (on average 2.041166380789022) internal successors, (1190), 596 states have internal predecessors, (1190), 0 states have call successors, (0), 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-21 02:05:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1190 transitions. [2021-11-21 02:05:41,430 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1190 transitions. Word has length 11 [2021-11-21 02:05:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:41,430 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1190 transitions. [2021-11-21 02:05:41,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-21 02:05:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1190 transitions. [2021-11-21 02:05:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-21 02:05:41,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:41,433 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:41,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:41,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:41,647 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:41,649 INFO L85 PathProgramCache]: Analyzing trace with hash -188324643, now seen corresponding path program 1 times [2021-11-21 02:05:41,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914622303] [2021-11-21 02:05:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:41,651 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:41,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:41,652 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:41,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 02:05:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:41,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 02:05:41,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:41,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:41,868 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:41,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914622303] [2021-11-21 02:05:41,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914622303] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:41,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [416821925] [2021-11-21 02:05:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:41,869 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:05:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:05:41,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:05:41,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2021-11-21 02:05:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:42,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 02:05:42,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:42,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:42,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [416821925] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:42,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359684556] [2021-11-21 02:05:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:42,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:05:42,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:05:42,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:05:42,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 02:05:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:42,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 02:05:42,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:42,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:42,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359684556] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:42,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 02:05:42,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 7 [2021-11-21 02:05:42,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53505663] [2021-11-21 02:05:42,378 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 02:05:42,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 02:05:42,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 02:05:42,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-21 02:05:42,381 INFO L87 Difference]: Start difference. First operand 597 states and 1190 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 02:05:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:42,648 INFO L93 Difference]: Finished difference Result 601 states and 1194 transitions. [2021-11-21 02:05:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 02:05:42,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-21 02:05:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:42,654 INFO L225 Difference]: With dead ends: 601 [2021-11-21 02:05:42,654 INFO L226 Difference]: Without dead ends: 601 [2021-11-21 02:05:42,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-21 02:05:42,661 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:42,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 02:05:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-11-21 02:05:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2021-11-21 02:05:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 587 states have (on average 2.0340715502555367) internal successors, (1194), 600 states have internal predecessors, (1194), 0 states have call successors, (0), 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-21 02:05:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1194 transitions. [2021-11-21 02:05:42,685 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1194 transitions. Word has length 13 [2021-11-21 02:05:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:42,685 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 1194 transitions. [2021-11-21 02:05:42,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 02:05:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1194 transitions. [2021-11-21 02:05:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 02:05:42,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:42,692 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:42,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-21 02:05:42,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2021-11-21 02:05:43,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-21 02:05:43,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:43,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:43,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1588637725, now seen corresponding path program 2 times [2021-11-21 02:05:43,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:43,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474902080] [2021-11-21 02:05:43,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-21 02:05:43,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:43,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:43,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:43,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-21 02:05:43,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-21 02:05:43,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:05:43,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 02:05:43,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:43,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 02:05:43,501 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 02:05:43,502 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 23 [2021-11-21 02:05:43,583 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-21 02:05:43,584 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 38 [2021-11-21 02:05:43,686 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-21 02:05:43,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 54 [2021-11-21 02:05:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 02:05:43,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 02:05:43,928 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474902080] [2021-11-21 02:05:43,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474902080] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:43,929 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:43,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-21 02:05:43,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914513711] [2021-11-21 02:05:43,929 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:43,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 02:05:43,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 02:05:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:05:43,933 INFO L87 Difference]: Start difference. First operand 601 states and 1194 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:45,095 INFO L93 Difference]: Finished difference Result 792 states and 1576 transitions. [2021-11-21 02:05:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 02:05:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-21 02:05:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:45,101 INFO L225 Difference]: With dead ends: 792 [2021-11-21 02:05:45,102 INFO L226 Difference]: Without dead ends: 792 [2021-11-21 02:05:45,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:05:45,103 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:45,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-21 02:05:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-11-21 02:05:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 728. [2021-11-21 02:05:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 714 states have (on average 2.0280112044817926) internal successors, (1448), 727 states have internal predecessors, (1448), 0 states have call successors, (0), 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-21 02:05:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1448 transitions. [2021-11-21 02:05:45,130 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1448 transitions. Word has length 17 [2021-11-21 02:05:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:45,131 INFO L470 AbstractCegarLoop]: Abstraction has 728 states and 1448 transitions. [2021-11-21 02:05:45,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1448 transitions. [2021-11-21 02:05:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 02:05:45,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:45,136 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:45,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:45,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:45,354 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1861810810, now seen corresponding path program 1 times [2021-11-21 02:05:45,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:45,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903571829] [2021-11-21 02:05:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:45,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:45,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:45,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 02:05:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:45,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 02:05:45,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:45,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:45,715 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:45,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903571829] [2021-11-21 02:05:45,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903571829] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:45,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [512571064] [2021-11-21 02:05:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:45,715 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:05:45,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:05:45,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:05:45,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 02:05:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:45,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 02:05:45,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:45,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:45,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [512571064] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:45,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657420004] [2021-11-21 02:05:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:45,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:05:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:05:45,933 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:05:45,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-21 02:05:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:46,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-21 02:05:46,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 02:05:46,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-21 02:05:46,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657420004] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:46,108 INFO L186 FreeRefinementEngine]: Found 2 perfect and 4 imperfect interpolant sequences. [2021-11-21 02:05:46,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8, 8, 8, 8] total 18 [2021-11-21 02:05:46,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016370826] [2021-11-21 02:05:46,108 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:46,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 02:05:46,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:46,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 02:05:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-21 02:05:46,110 INFO L87 Difference]: Start difference. First operand 728 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:46,269 INFO L93 Difference]: Finished difference Result 1052 states and 2096 transitions. [2021-11-21 02:05:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 02:05:46,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-21 02:05:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:46,277 INFO L225 Difference]: With dead ends: 1052 [2021-11-21 02:05:46,277 INFO L226 Difference]: Without dead ends: 1052 [2021-11-21 02:05:46,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-21 02:05:46,279 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 66 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:46,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 105 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 02:05:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2021-11-21 02:05:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1013. [2021-11-21 02:05:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 999 states have (on average 2.059059059059059) internal successors, (2057), 1012 states have internal predecessors, (2057), 0 states have call successors, (0), 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-21 02:05:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2057 transitions. [2021-11-21 02:05:46,332 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2057 transitions. Word has length 17 [2021-11-21 02:05:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:46,332 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 2057 transitions. [2021-11-21 02:05:46,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2057 transitions. [2021-11-21 02:05:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-21 02:05:46,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:46,334 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:46,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:46,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:46,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:46,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:46,937 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:46,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -756668167, now seen corresponding path program 1 times [2021-11-21 02:05:46,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:46,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642141364] [2021-11-21 02:05:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:46,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:46,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:46,940 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:46,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-21 02:05:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:47,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 02:05:47,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,267 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:47,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642141364] [2021-11-21 02:05:47,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642141364] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:47,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [608388245] [2021-11-21 02:05:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:47,268 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:05:47,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:05:47,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:05:47,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-11-21 02:05:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:47,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 02:05:47,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [608388245] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634570000] [2021-11-21 02:05:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:47,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:05:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:05:47,479 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:05:47,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-21 02:05:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:47,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-21 02:05:47,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 02:05:47,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634570000] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:05:47,662 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 02:05:47,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 15 [2021-11-21 02:05:47,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582665774] [2021-11-21 02:05:47,663 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 02:05:47,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-21 02:05:47,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-21 02:05:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-11-21 02:05:47,664 INFO L87 Difference]: Start difference. First operand 1013 states and 2057 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 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-21 02:05:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:48,049 INFO L93 Difference]: Finished difference Result 1017 states and 2061 transitions. [2021-11-21 02:05:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 02:05:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 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 17 [2021-11-21 02:05:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:48,057 INFO L225 Difference]: With dead ends: 1017 [2021-11-21 02:05:48,057 INFO L226 Difference]: Without dead ends: 1017 [2021-11-21 02:05:48,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-11-21 02:05:48,058 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:48,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 02:05:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-11-21 02:05:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1017. [2021-11-21 02:05:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1003 states have (on average 2.0548354935194415) internal successors, (2061), 1016 states have internal predecessors, (2061), 0 states have call successors, (0), 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-21 02:05:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 2061 transitions. [2021-11-21 02:05:48,095 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 2061 transitions. Word has length 17 [2021-11-21 02:05:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:48,095 INFO L470 AbstractCegarLoop]: Abstraction has 1017 states and 2061 transitions. [2021-11-21 02:05:48,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 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-21 02:05:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 2061 transitions. [2021-11-21 02:05:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-21 02:05:48,096 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:48,097 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 02:05:48,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:48,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:48,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:48,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:48,725 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1547228217, now seen corresponding path program 2 times [2021-11-21 02:05:48,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:48,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607979319] [2021-11-21 02:05:48,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-21 02:05:48,726 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:48,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:48,727 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:48,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-21 02:05:48,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-21 02:05:48,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:05:48,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 02:05:48,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:48,817 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-21 02:05:48,842 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 02:05:48,842 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 24 treesize of output 26 [2021-11-21 02:05:48,939 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-21 02:05:48,939 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 49 treesize of output 57 [2021-11-21 02:05:49,129 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-21 02:05:49,129 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 69 treesize of output 83 [2021-11-21 02:05:49,233 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-21 02:05:49,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:49,404 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-21 02:05:49,405 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:49,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607979319] [2021-11-21 02:05:49,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607979319] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:49,405 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:49,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:05:49,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765372399] [2021-11-21 02:05:49,405 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:49,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 02:05:49,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 02:05:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:05:49,407 INFO L87 Difference]: Start difference. First operand 1017 states and 2061 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-21 02:05:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:50,004 INFO L93 Difference]: Finished difference Result 1203 states and 2432 transitions. [2021-11-21 02:05:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 02:05:50,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-21 02:05:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:50,014 INFO L225 Difference]: With dead ends: 1203 [2021-11-21 02:05:50,014 INFO L226 Difference]: Without dead ends: 1203 [2021-11-21 02:05:50,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:05:50,015 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:50,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-21 02:05:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-11-21 02:05:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1139. [2021-11-21 02:05:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1126 states have (on average 2.0461811722912966) internal successors, (2304), 1138 states have internal predecessors, (2304), 0 states have call successors, (0), 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-21 02:05:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2304 transitions. [2021-11-21 02:05:50,056 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2304 transitions. Word has length 21 [2021-11-21 02:05:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:50,057 INFO L470 AbstractCegarLoop]: Abstraction has 1139 states and 2304 transitions. [2021-11-21 02:05:50,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-21 02:05:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2304 transitions. [2021-11-21 02:05:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 02:05:50,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:50,059 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-21 02:05:50,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:50,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:50,272 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:50,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1863061868, now seen corresponding path program 1 times [2021-11-21 02:05:50,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:50,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101871234] [2021-11-21 02:05:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:50,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:50,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:50,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:50,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-21 02:05:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:50,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 02:05:50,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:50,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 02:05:50,455 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 02:05:50,456 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 34 [2021-11-21 02:05:50,536 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-21 02:05:50,536 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 50 treesize of output 58 [2021-11-21 02:05:50,665 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-21 02:05:50,666 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 72 treesize of output 86 [2021-11-21 02:05:50,781 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-21 02:05:50,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:50,978 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-21 02:05:50,978 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:50,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101871234] [2021-11-21 02:05:50,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101871234] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:50,978 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:50,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:05:50,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386555931] [2021-11-21 02:05:50,979 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:50,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 02:05:50,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 02:05:50,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:05:50,980 INFO L87 Difference]: Start difference. First operand 1139 states and 2304 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:51,866 INFO L93 Difference]: Finished difference Result 1359 states and 2754 transitions. [2021-11-21 02:05:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 02:05:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-21 02:05:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:51,876 INFO L225 Difference]: With dead ends: 1359 [2021-11-21 02:05:51,877 INFO L226 Difference]: Without dead ends: 1327 [2021-11-21 02:05:51,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=33, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:05:51,878 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 71 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:51,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 45 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 0 Unknown, 169 Unchecked, 0.8s Time] [2021-11-21 02:05:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2021-11-21 02:05:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1279. [2021-11-21 02:05:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1266 states have (on average 2.044233807266983) internal successors, (2588), 1278 states have internal predecessors, (2588), 0 states have call successors, (0), 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-21 02:05:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2588 transitions. [2021-11-21 02:05:51,920 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2588 transitions. Word has length 27 [2021-11-21 02:05:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:51,920 INFO L470 AbstractCegarLoop]: Abstraction has 1279 states and 2588 transitions. [2021-11-21 02:05:51,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 02:05:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2588 transitions. [2021-11-21 02:05:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 02:05:51,922 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:51,922 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-21 02:05:51,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:52,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:52,135 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 544199581, now seen corresponding path program 1 times [2021-11-21 02:05:52,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:52,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680331616] [2021-11-21 02:05:52,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:52,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:52,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:52,138 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:52,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-21 02:05:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:52,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 02:05:52,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:52,289 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-21 02:05:52,311 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-21 02:05:52,311 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 24 treesize of output 26 [2021-11-21 02:05:52,369 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-21 02:05:52,370 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 43 treesize of output 51 [2021-11-21 02:05:52,460 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-21 02:05:52,460 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 69 treesize of output 83 [2021-11-21 02:05:52,534 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-21 02:05:52,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:52,704 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-21 02:05:52,704 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:52,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680331616] [2021-11-21 02:05:52,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680331616] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:52,704 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:52,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-21 02:05:52,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536864152] [2021-11-21 02:05:52,704 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:52,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 02:05:52,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 02:05:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:05:52,706 INFO L87 Difference]: Start difference. First operand 1279 states and 2588 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 02:05:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:53,447 INFO L93 Difference]: Finished difference Result 1410 states and 2849 transitions. [2021-11-21 02:05:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 02:05:53,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 02:05:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:53,465 INFO L225 Difference]: With dead ends: 1410 [2021-11-21 02:05:53,465 INFO L226 Difference]: Without dead ends: 1410 [2021-11-21 02:05:53,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=20, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:05:53,467 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:53,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 11 Unchecked, 0.7s Time] [2021-11-21 02:05:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2021-11-21 02:05:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2021-11-21 02:05:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1397 states have (on average 2.0393700787401574) internal successors, (2849), 1409 states have internal predecessors, (2849), 0 states have call successors, (0), 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-21 02:05:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2849 transitions. [2021-11-21 02:05:53,542 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2849 transitions. Word has length 27 [2021-11-21 02:05:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:53,544 INFO L470 AbstractCegarLoop]: Abstraction has 1410 states and 2849 transitions. [2021-11-21 02:05:53,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-21 02:05:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2849 transitions. [2021-11-21 02:05:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:05:53,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:53,546 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-21 02:05:53,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:53,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:53,760 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1827321430, now seen corresponding path program 1 times [2021-11-21 02:05:53,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345543124] [2021-11-21 02:05:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:05:53,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:53,762 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:53,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-21 02:05:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:05:53,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 02:05:53,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:53,919 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-21 02:05:53,987 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-21 02:05:53,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:54,073 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 20 treesize of output 18 [2021-11-21 02:05:54,077 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 33 treesize of output 29 [2021-11-21 02:05:54,127 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-21 02:05:54,127 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:54,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345543124] [2021-11-21 02:05:54,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345543124] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:54,127 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:54,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-21 02:05:54,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065448797] [2021-11-21 02:05:54,128 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:54,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 02:05:54,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 02:05:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:05:54,129 INFO L87 Difference]: Start difference. First operand 1410 states and 2849 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:54,886 INFO L93 Difference]: Finished difference Result 3999 states and 8058 transitions. [2021-11-21 02:05:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 02:05:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:54,915 INFO L225 Difference]: With dead ends: 3999 [2021-11-21 02:05:54,915 INFO L226 Difference]: Without dead ends: 3999 [2021-11-21 02:05:54,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-21 02:05:54,917 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 180 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:54,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 265 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 02:05:54,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2021-11-21 02:05:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 1480. [2021-11-21 02:05:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1467 states have (on average 2.0286298568507157) internal successors, (2976), 1479 states have internal predecessors, (2976), 0 states have call successors, (0), 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-21 02:05:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2976 transitions. [2021-11-21 02:05:54,995 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2976 transitions. Word has length 31 [2021-11-21 02:05:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:54,995 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 2976 transitions. [2021-11-21 02:05:54,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2976 transitions. [2021-11-21 02:05:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:05:54,997 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:54,997 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-21 02:05:55,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-21 02:05:55,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:55,211 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 279791532, now seen corresponding path program 2 times [2021-11-21 02:05:55,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:55,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031228529] [2021-11-21 02:05:55,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-21 02:05:55,213 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:55,214 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:55,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-21 02:05:55,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-21 02:05:55,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:05:55,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 02:05:55,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:55,380 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-21 02:05:55,440 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-21 02:05:55,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:55,518 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 24 treesize of output 22 [2021-11-21 02:05:55,520 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 28 treesize of output 21 [2021-11-21 02:05:55,597 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-21 02:05:55,598 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:55,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031228529] [2021-11-21 02:05:55,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031228529] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:55,598 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:55,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:05:55,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203193460] [2021-11-21 02:05:55,598 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:55,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 02:05:55,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 02:05:55,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-21 02:05:55,599 INFO L87 Difference]: Start difference. First operand 1480 states and 2976 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:57,759 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:05:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:58,148 INFO L93 Difference]: Finished difference Result 3713 states and 7487 transitions. [2021-11-21 02:05:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 02:05:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:58,177 INFO L225 Difference]: With dead ends: 3713 [2021-11-21 02:05:58,177 INFO L226 Difference]: Without dead ends: 3713 [2021-11-21 02:05:58,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-21 02:05:58,179 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 266 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:58,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 252 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2021-11-21 02:05:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2021-11-21 02:05:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 1481. [2021-11-21 02:05:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1468 states have (on average 2.0286103542234333) internal successors, (2978), 1480 states have internal predecessors, (2978), 0 states have call successors, (0), 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-21 02:05:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2978 transitions. [2021-11-21 02:05:58,246 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2978 transitions. Word has length 31 [2021-11-21 02:05:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:58,246 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2978 transitions. [2021-11-21 02:05:58,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:05:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2978 transitions. [2021-11-21 02:05:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:05:58,248 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:58,248 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-21 02:05:58,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-21 02:05:58,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:05:58,460 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:05:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:05:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -725407954, now seen corresponding path program 3 times [2021-11-21 02:05:58,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:05:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089914510] [2021-11-21 02:05:58,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 02:05:58,462 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:05:58,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:05:58,463 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:05:58,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-21 02:05:58,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 02:05:58,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:05:58,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 02:05:58,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:05:58,625 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-21 02:05:58,757 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-21 02:05:58,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:05:58,882 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-21 02:05:58,884 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-21 02:05:58,939 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-21 02:05:58,939 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:05:58,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089914510] [2021-11-21 02:05:58,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089914510] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:05:58,939 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:05:58,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:05:58,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127456707] [2021-11-21 02:05:58,940 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:05:58,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 02:05:58,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:05:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 02:05:58,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-21 02:05:58,941 INFO L87 Difference]: Start difference. First operand 1481 states and 2978 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:05:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:05:59,730 INFO L93 Difference]: Finished difference Result 3942 states and 7898 transitions. [2021-11-21 02:05:59,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 02:05:59,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:05:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:05:59,754 INFO L225 Difference]: With dead ends: 3942 [2021-11-21 02:05:59,754 INFO L226 Difference]: Without dead ends: 3942 [2021-11-21 02:05:59,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:05:59,755 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 304 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 02:05:59,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 196 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-21 02:05:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2021-11-21 02:05:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 1494. [2021-11-21 02:05:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1481 states have (on average 2.0195813639432814) internal successors, (2991), 1493 states have internal predecessors, (2991), 0 states have call successors, (0), 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-21 02:05:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2991 transitions. [2021-11-21 02:05:59,818 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2991 transitions. Word has length 31 [2021-11-21 02:05:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:05:59,818 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 2991 transitions. [2021-11-21 02:05:59,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:05:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2991 transitions. [2021-11-21 02:05:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:05:59,819 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:05:59,820 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-21 02:05:59,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-21 02:06:00,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:06:00,033 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:06:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:06:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1258996910, now seen corresponding path program 4 times [2021-11-21 02:06:00,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:06:00,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244456461] [2021-11-21 02:06:00,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 02:06:00,034 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:06:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:06:00,035 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:06:00,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-21 02:06:00,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 02:06:00,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:06:00,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 02:06:00,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:00,183 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-21 02:06:00,243 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-21 02:06:00,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:00,313 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 23 treesize of output 21 [2021-11-21 02:06:00,317 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 27 treesize of output 20 [2021-11-21 02:06:00,403 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-21 02:06:00,403 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:06:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244456461] [2021-11-21 02:06:00,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244456461] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:06:00,403 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:06:00,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:06:00,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72828246] [2021-11-21 02:06:00,404 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:06:00,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 02:06:00,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:06:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 02:06:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-21 02:06:00,405 INFO L87 Difference]: Start difference. First operand 1494 states and 2991 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:06:02,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:06:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:06:02,860 INFO L93 Difference]: Finished difference Result 2663 states and 5271 transitions. [2021-11-21 02:06:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 02:06:02,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:06:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:06:02,873 INFO L225 Difference]: With dead ends: 2663 [2021-11-21 02:06:02,873 INFO L226 Difference]: Without dead ends: 2663 [2021-11-21 02:06:02,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-11-21 02:06:02,874 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 200 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-21 02:06:02,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 246 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-21 02:06:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2021-11-21 02:06:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 1494. [2021-11-21 02:06:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1481 states have (on average 2.0195813639432814) internal successors, (2991), 1493 states have internal predecessors, (2991), 0 states have call successors, (0), 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-21 02:06:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2991 transitions. [2021-11-21 02:06:02,925 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2991 transitions. Word has length 31 [2021-11-21 02:06:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:06:02,926 INFO L470 AbstractCegarLoop]: Abstraction has 1494 states and 2991 transitions. [2021-11-21 02:06:02,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 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-21 02:06:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2991 transitions. [2021-11-21 02:06:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:06:02,927 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:06:02,927 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-21 02:06:02,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-21 02:06:03,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:06:03,141 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:06:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:06:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2030770900, now seen corresponding path program 5 times [2021-11-21 02:06:03,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:06:03,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115090645] [2021-11-21 02:06:03,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-21 02:06:03,142 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:06:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:06:03,144 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:06:03,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-21 02:06:03,220 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-11-21 02:06:03,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:06:03,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 02:06:03,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:03,269 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-21 02:06:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-21 02:06:03,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:03,556 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 23 treesize of output 21 [2021-11-21 02:06:03,558 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 27 treesize of output 20 [2021-11-21 02:06:03,648 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-21 02:06:03,649 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:06:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115090645] [2021-11-21 02:06:03,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115090645] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:06:03,649 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:06:03,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-21 02:06:03,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189243162] [2021-11-21 02:06:03,650 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:06:03,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 02:06:03,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:06:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 02:06:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-21 02:06:03,651 INFO L87 Difference]: Start difference. First operand 1494 states and 2991 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:06:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:06:04,285 INFO L93 Difference]: Finished difference Result 2574 states and 5078 transitions. [2021-11-21 02:06:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 02:06:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:06:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:06:04,293 INFO L225 Difference]: With dead ends: 2574 [2021-11-21 02:06:04,293 INFO L226 Difference]: Without dead ends: 2574 [2021-11-21 02:06:04,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-21 02:06:04,294 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 179 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 02:06:04,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 261 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 02:06:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2021-11-21 02:06:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1493. [2021-11-21 02:06:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1480 states have (on average 2.0195945945945946) internal successors, (2989), 1492 states have internal predecessors, (2989), 0 states have call successors, (0), 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-21 02:06:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2989 transitions. [2021-11-21 02:06:04,346 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2989 transitions. Word has length 31 [2021-11-21 02:06:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:06:04,346 INFO L470 AbstractCegarLoop]: Abstraction has 1493 states and 2989 transitions. [2021-11-21 02:06:04,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-21 02:06:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2989 transitions. [2021-11-21 02:06:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 02:06:04,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:06:04,348 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-21 02:06:04,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-11-21 02:06:04,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:06:04,562 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 02:06:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:06:04,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1107905934, now seen corresponding path program 6 times [2021-11-21 02:06:04,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:06:04,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087822442] [2021-11-21 02:06:04,563 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-21 02:06:04,563 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:06:04,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:06:04,564 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:06:04,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-21 02:06:04,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-11-21 02:06:04,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 02:06:04,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 02:06:04,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:04,671 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-21 02:06:04,821 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-21 02:06:04,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:04,943 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 20 treesize of output 18 [2021-11-21 02:06:04,948 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 33 treesize of output 29 [2021-11-21 02:06:04,981 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-21 02:06:04,981 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:06:04,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087822442] [2021-11-21 02:06:04,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087822442] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 02:06:04,982 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 02:06:04,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-21 02:06:04,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064584134] [2021-11-21 02:06:04,982 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 02:06:04,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 02:06:04,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:06:04,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 02:06:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-21 02:06:04,983 INFO L87 Difference]: Start difference. First operand 1493 states and 2989 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-21 02:06:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:06:05,764 INFO L93 Difference]: Finished difference Result 2573 states and 5089 transitions. [2021-11-21 02:06:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 02:06:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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 31 [2021-11-21 02:06:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:06:05,770 INFO L225 Difference]: With dead ends: 2573 [2021-11-21 02:06:05,770 INFO L226 Difference]: Without dead ends: 2573 [2021-11-21 02:06:05,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-21 02:06:05,771 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 118 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-21 02:06:05,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 276 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-21 02:06:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2021-11-21 02:06:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1480. [2021-11-21 02:06:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1467 states have (on average 2.019768234492161) internal successors, (2963), 1479 states have internal predecessors, (2963), 0 states have call successors, (0), 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-21 02:06:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2963 transitions. [2021-11-21 02:06:05,819 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2963 transitions. Word has length 31 [2021-11-21 02:06:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:06:05,820 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 2963 transitions. [2021-11-21 02:06:05,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-21 02:06:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2963 transitions. [2021-11-21 02:06:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:06:05,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:06:05,822 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-21 02:06:05,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-21 02:06:06,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:06:06,035 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-21 02:06:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:06:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash 166135916, now seen corresponding path program 1 times [2021-11-21 02:06:06,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:06:06,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201834246] [2021-11-21 02:06:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:06:06,036 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:06:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:06:06,037 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:06:06,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-21 02:06:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:06:06,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 02:06:06,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:06,523 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-21 02:06:06,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,579 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 24 treesize of output 23 [2021-11-21 02:06:06,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,635 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 40 treesize of output 42 [2021-11-21 02:06:06,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,728 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 62 treesize of output 67 [2021-11-21 02:06:06,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:06,850 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:06:06,850 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 80 treesize of output 88 [2021-11-21 02:06:06,917 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-21 02:06:06,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:07,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:07,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:08,830 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-21 02:06:08,830 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:06:08,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201834246] [2021-11-21 02:06:08,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201834246] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:06:08,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1486889363] [2021-11-21 02:06:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:06:08,831 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:06:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:06:08,840 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:06:08,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-11-21 02:06:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:06:09,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 02:06:09,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:10,178 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-21 02:06:10,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,263 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 30 treesize of output 29 [2021-11-21 02:06:10,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,351 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 48 treesize of output 50 [2021-11-21 02:06:10,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,467 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 68 treesize of output 73 [2021-11-21 02:06:10,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:10,668 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 84 treesize of output 92 [2021-11-21 02:06:10,788 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-21 02:06:10,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:11,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:11,830 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-21 02:06:11,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1486889363] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:06:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158160114] [2021-11-21 02:06:11,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:06:11,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:06:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:06:11,831 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:06:11,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-21 02:06:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:06:11,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 02:06:11,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:06:12,192 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-21 02:06:12,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,228 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 24 treesize of output 23 [2021-11-21 02:06:12,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,258 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 38 treesize of output 40 [2021-11-21 02:06:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,313 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 70 treesize of output 75 [2021-11-21 02:06:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:06:12,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:06:12,428 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 74 treesize of output 82 [2021-11-21 02:06:12,465 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-21 02:06:12,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:06:12,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:12,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:12,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:12,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:12,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:12,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:13,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:13,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:13,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:06:13,635 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-21 02:06:13,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158160114] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:06:13,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 02:06:13,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 11] total 33 [2021-11-21 02:06:13,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364391572] [2021-11-21 02:06:13,636 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 02:06:13,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-21 02:06:13,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:06:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-21 02:06:13,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2021-11-21 02:06:13,638 INFO L87 Difference]: Start difference. First operand 1480 states and 2963 transitions. Second operand has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:06:19,701 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:06:44,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:06:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:06:59,869 INFO L93 Difference]: Finished difference Result 13547 states and 27155 transitions. [2021-11-21 02:06:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-21 02:06:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:06:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:06:59,910 INFO L225 Difference]: With dead ends: 13547 [2021-11-21 02:06:59,911 INFO L226 Difference]: Without dead ends: 13547 [2021-11-21 02:06:59,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 223 SyntacticMatches, 9 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4037 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=1979, Invalid=8323, Unknown=0, NotChecked=0, Total=10302 [2021-11-21 02:06:59,915 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 1372 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 6223 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 6500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 6223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2021-11-21 02:06:59,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1372 Valid, 523 Invalid, 6500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 6223 Invalid, 0 Unknown, 0 Unchecked, 25.3s Time] [2021-11-21 02:06:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13547 states. [2021-11-21 02:07:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13547 to 4258. [2021-11-21 02:07:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4258 states, 4245 states have (on average 2.1382803297997643) internal successors, (9077), 4257 states have internal predecessors, (9077), 0 states have call successors, (0), 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-21 02:07:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 9077 transitions. [2021-11-21 02:07:00,162 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 9077 transitions. Word has length 45 [2021-11-21 02:07:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:07:00,163 INFO L470 AbstractCegarLoop]: Abstraction has 4258 states and 9077 transitions. [2021-11-21 02:07:00,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:07:00,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 9077 transitions. [2021-11-21 02:07:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:07:00,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:07:00,168 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-21 02:07:00,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2021-11-21 02:07:00,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-21 02:07:00,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-21 02:07:00,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:07:00,772 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-21 02:07:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:07:00,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1899402712, now seen corresponding path program 1 times [2021-11-21 02:07:00,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:07:00,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61382126] [2021-11-21 02:07:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:07:00,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:07:00,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:07:00,774 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:07:00,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-21 02:07:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:07:00,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 02:07:00,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:07:01,212 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-21 02:07:01,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,251 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-21 02:07:01,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,280 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-21 02:07:01,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:07:01,326 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 31 treesize of output 33 [2021-11-21 02:07:01,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:01,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:07:01,407 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 41 treesize of output 46 [2021-11-21 02:07:01,454 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-21 02:07:01,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:07:01,753 INFO L354 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2021-11-21 02:07:01,753 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 49 treesize of output 45 [2021-11-21 02:07:01,760 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 02:07:01,760 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 45 treesize of output 45 [2021-11-21 02:07:01,777 INFO L354 Elim1Store]: treesize reduction 1, result has 87.5 percent of original size [2021-11-21 02:07:01,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-11-21 02:07:02,224 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-21 02:07:02,224 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:07:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61382126] [2021-11-21 02:07:02,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61382126] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:07:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2046735328] [2021-11-21 02:07:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:07:02,225 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:07:02,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:07:02,226 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:07:02,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-11-21 02:07:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:07:02,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-21 02:07:02,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:07:03,450 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-21 02:07:03,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,503 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-21 02:07:03,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,561 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 24 treesize of output 23 [2021-11-21 02:07:03,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,637 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 34 treesize of output 36 [2021-11-21 02:07:03,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:03,728 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 48 treesize of output 53 [2021-11-21 02:07:03,804 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-21 02:07:03,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:07:03,987 INFO L354 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2021-11-21 02:07:03,987 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 49 treesize of output 45 [2021-11-21 02:07:03,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-21 02:07:03,995 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 55 treesize of output 53 [2021-11-21 02:07:04,234 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-21 02:07:04,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2046735328] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:07:04,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934495624] [2021-11-21 02:07:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:07:04,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 02:07:04,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 02:07:04,236 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 02:07:04,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-21 02:07:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:07:04,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-21 02:07:04,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:07:04,604 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-21 02:07:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,625 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-21 02:07:04,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,642 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 24 treesize of output 23 [2021-11-21 02:07:04,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:07:04,671 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-21 02:07:04,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:04,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:07:04,724 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 42 treesize of output 47 [2021-11-21 02:07:04,762 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-21 02:07:04,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:07:04,947 INFO L354 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2021-11-21 02:07:04,948 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 49 treesize of output 45 [2021-11-21 02:07:04,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-11-21 02:07:04,952 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 55 treesize of output 53 [2021-11-21 02:07:05,174 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-21 02:07:05,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934495624] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:07:05,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 02:07:05,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11, 11] total 33 [2021-11-21 02:07:05,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409404073] [2021-11-21 02:07:05,175 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 02:07:05,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-21 02:07:05,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 02:07:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-21 02:07:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2021-11-21 02:07:05,177 INFO L87 Difference]: Start difference. First operand 4258 states and 9077 transitions. Second operand has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:07:24,789 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:07:27,120 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:07:29,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:07:33,124 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:07:40,782 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-21 02:07:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 02:07:44,385 INFO L93 Difference]: Finished difference Result 15809 states and 31890 transitions. [2021-11-21 02:07:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-21 02:07:44,387 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:07:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 02:07:44,433 INFO L225 Difference]: With dead ends: 15809 [2021-11-21 02:07:44,433 INFO L226 Difference]: Without dead ends: 15809 [2021-11-21 02:07:44,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 224 SyntacticMatches, 25 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 11222 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3690, Invalid=20490, Unknown=0, NotChecked=0, Total=24180 [2021-11-21 02:07:44,443 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 1641 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 9070 mSolverCounterSat, 435 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 10308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 9070 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2021-11-21 02:07:44,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1641 Valid, 872 Invalid, 10308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 9070 Invalid, 3 Unknown, 800 Unchecked, 26.9s Time] [2021-11-21 02:07:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15809 states. [2021-11-21 02:07:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15809 to 5901. [2021-11-21 02:07:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5901 states, 5888 states have (on average 2.1689877717391304) internal successors, (12771), 5900 states have internal predecessors, (12771), 0 states have call successors, (0), 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-21 02:07:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 12771 transitions. [2021-11-21 02:07:44,813 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 12771 transitions. Word has length 45 [2021-11-21 02:07:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 02:07:44,813 INFO L470 AbstractCegarLoop]: Abstraction has 5901 states and 12771 transitions. [2021-11-21 02:07:44,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 34 states have internal predecessors, (108), 0 states have call successors, (0), 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-21 02:07:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 12771 transitions. [2021-11-21 02:07:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 02:07:44,818 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 02:07:44,818 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-21 02:07:44,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-21 02:07:45,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2021-11-21 02:07:45,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-11-21 02:07:45,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 02:07:45,441 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-21 02:07:45,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 02:07:45,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1678184783, now seen corresponding path program 1 times [2021-11-21 02:07:45,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 02:07:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514787371] [2021-11-21 02:07:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:07:45,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 02:07:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 02:07:45,443 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 02:07:45,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-21 02:07:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:07:45,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-21 02:07:45,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:07:45,831 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-21 02:07:45,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:45,868 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 24 treesize of output 23 [2021-11-21 02:07:45,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:45,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:45,918 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 35 treesize of output 37 [2021-11-21 02:07:46,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,027 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 51 treesize of output 56 [2021-11-21 02:07:46,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,170 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 64 treesize of output 72 [2021-11-21 02:07:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,286 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 75 treesize of output 86 [2021-11-21 02:07:46,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,393 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 91 treesize of output 105 [2021-11-21 02:07:46,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,584 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 105 treesize of output 122 [2021-11-21 02:07:46,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:46,831 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 02:07:46,831 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 115 treesize of output 128 [2021-11-21 02:07:46,899 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-21 02:07:46,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 02:07:54,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,279 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:54,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 02:07:55,935 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-21 02:07:55,935 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 02:07:55,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514787371] [2021-11-21 02:07:55,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514787371] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 02:07:55,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648401942] [2021-11-21 02:07:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 02:07:55,936 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 02:07:55,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 02:07:55,937 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 02:07:55,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f8b1340-7bcd-4525-8200-48a812f411db/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-11-21 02:07:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 02:07:56,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-21 02:07:56,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 02:07:57,172 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-21 02:07:57,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,250 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 24 treesize of output 23 [2021-11-21 02:07:57,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2021-11-21 02:07:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,471 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 45 treesize of output 50 [2021-11-21 02:07:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,672 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 56 treesize of output 64 [2021-11-21 02:07:57,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:57,840 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 69 treesize of output 80 [2021-11-21 02:07:58,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,061 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 84 treesize of output 98 [2021-11-21 02:07:58,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,261 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 104 treesize of output 121 [2021-11-21 02:07:58,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 02:07:58,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 127 [2021-11-21 02:07:58,780 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-21 02:07:58,780 INFO L328 TraceCheckSpWp]: Computing backward predicates...