./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V --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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:03:59,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:03:59,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:03:59,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:03:59,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:03:59,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:03:59,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:03:59,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:03:59,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:03:59,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:03:59,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:03:59,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:03:59,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:03:59,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:03:59,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:03:59,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:03:59,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:03:59,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:03:59,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:03:59,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:03:59,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:03:59,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:03:59,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:03:59,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:03:59,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:03:59,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:03:59,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:03:59,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:03:59,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:03:59,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:03:59,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:03:59,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:03:59,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:03:59,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:03:59,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:03:59,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:03:59,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:03:59,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:03:59,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:03:59,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:03:59,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:03:59,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-23 02:03:59,378 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:03:59,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:03:59,379 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:03:59,379 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:03:59,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:03:59,380 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:03:59,381 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:03:59,381 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:03:59,381 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:03:59,382 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:03:59,382 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:03:59,382 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:03:59,383 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:03:59,383 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:03:59,383 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:03:59,384 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:03:59,384 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:03:59,384 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:03:59,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:03:59,386 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:03:59,386 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:03:59,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:03:59,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:03:59,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:03:59,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:03:59,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:03:59,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:03:59,388 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-23 02:03:59,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:03:59,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:03:59,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:03:59,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:03:59,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:03:59,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:03:59,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:03:59,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:03:59,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:03:59,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:03:59,392 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:03:59,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:03:59,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:03:59,393 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:03:59,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:03:59,393 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_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/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_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2021-11-23 02:03:59,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:03:59,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:03:59,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:03:59,762 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:03:59,764 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:03:59,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2021-11-23 02:03:59,894 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/data/a27eef116/1f7c9725fbf44a91bf75426572ebff1c/FLAGdba33f2b3 [2021-11-23 02:04:00,687 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:04:00,688 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2021-11-23 02:04:00,724 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/data/a27eef116/1f7c9725fbf44a91bf75426572ebff1c/FLAGdba33f2b3 [2021-11-23 02:04:00,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/data/a27eef116/1f7c9725fbf44a91bf75426572ebff1c [2021-11-23 02:04:00,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:04:00,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:04:00,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:04:00,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:04:00,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:04:00,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:00" (1/1) ... [2021-11-23 02:04:00,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306e2257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:00, skipping insertion in model container [2021-11-23 02:04:00,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:04:00" (1/1) ... [2021-11-23 02:04:00,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:04:00,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:04:01,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:04:01,601 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:04:01,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:04:01,722 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:04:01,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01 WrapperNode [2021-11-23 02:04:01,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:04:01,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:04:01,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:04:01,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:04:01,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,837 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2021-11-23 02:04:01,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:04:01,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:04:01,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:04:01,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:04:01,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:04:01,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:04:01,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:04:01,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:04:01,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (1/1) ... [2021-11-23 02:04:01,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:04:01,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:01,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:04:02,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:04:02,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:04:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:04:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:04:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:04:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-23 02:04:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:04:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-23 02:04:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-23 02:04:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:04:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:04:02,050 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-23 02:04:02,202 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:04:02,207 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:04:02,678 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:04:02,688 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:04:02,688 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-23 02:04:02,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:02 BoogieIcfgContainer [2021-11-23 02:04:02,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:04:02,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:04:02,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:04:02,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:04:02,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:04:00" (1/3) ... [2021-11-23 02:04:02,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f18ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:04:02, skipping insertion in model container [2021-11-23 02:04:02,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:04:01" (2/3) ... [2021-11-23 02:04:02,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443f18ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:04:02, skipping insertion in model container [2021-11-23 02:04:02,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:04:02" (3/3) ... [2021-11-23 02:04:02,707 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2021-11-23 02:04:02,713 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-23 02:04:02,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:04:02,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-23 02:04:02,714 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-23 02:04:02,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,767 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-23 02:04:02,767 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-23 02:04:02,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,767 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-23 02:04:02,767 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-23 02:04:02,768 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-23 02:04:02,768 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-23 02:04:02,768 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-23 02:04:02,768 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-23 02:04:02,769 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-23 02:04:02,769 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-23 02:04:02,769 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-23 02:04:02,769 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-23 02:04:02,769 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-23 02:04:02,769 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-23 02:04:02,770 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-23 02:04:02,770 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-23 02:04:02,770 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-23 02:04:02,770 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-23 02:04:02,770 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-23 02:04:02,771 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-23 02:04:02,771 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-23 02:04:02,771 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-23 02:04:02,771 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-23 02:04:02,772 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-23 02:04:02,772 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-23 02:04:02,772 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-23 02:04:02,772 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-23 02:04:02,773 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-23 02:04:02,773 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-23 02:04:02,773 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-23 02:04:02,774 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-23 02:04:02,774 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-23 02:04:02,774 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-23 02:04:02,774 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-23 02:04:02,774 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-23 02:04:02,775 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-23 02:04:02,775 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-23 02:04:02,775 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-23 02:04:02,776 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-23 02:04:02,776 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-23 02:04:02,776 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-23 02:04:02,776 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-23 02:04:02,777 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-23 02:04:02,777 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-23 02:04:02,777 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-23 02:04:02,777 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-23 02:04:02,778 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-23 02:04:02,778 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-23 02:04:02,803 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-23 02:04:02,803 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-23 02:04:02,803 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-23 02:04:02,804 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-23 02:04:02,804 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-23 02:04:02,804 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-23 02:04:02,804 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-23 02:04:02,805 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-23 02:04:02,805 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-23 02:04:02,805 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-23 02:04:02,805 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-23 02:04:02,805 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-23 02:04:02,806 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-23 02:04:02,806 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-23 02:04:02,806 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-23 02:04:02,806 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-23 02:04:02,807 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-23 02:04:02,807 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-23 02:04:02,807 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-23 02:04:02,807 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-23 02:04:02,807 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-23 02:04:02,807 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-23 02:04:02,808 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-23 02:04:02,808 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-23 02:04:02,808 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-23 02:04:02,808 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-23 02:04:02,808 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-23 02:04:02,809 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-23 02:04:02,809 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-23 02:04:02,809 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-23 02:04:02,809 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-23 02:04:02,810 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-23 02:04:02,810 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-23 02:04:02,810 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-23 02:04:02,810 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-23 02:04:02,810 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-23 02:04:02,811 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-23 02:04:02,811 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-23 02:04:02,811 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-23 02:04:02,811 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-23 02:04:02,811 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-23 02:04:02,812 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-23 02:04:02,812 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-23 02:04:02,812 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-23 02:04:02,812 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-23 02:04:02,812 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-23 02:04:02,813 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-23 02:04:02,813 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-23 02:04:02,813 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-23 02:04:02,813 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-23 02:04:02,813 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-23 02:04:02,814 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-23 02:04:02,814 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-23 02:04:02,814 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-23 02:04:02,814 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-23 02:04:02,814 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-23 02:04:02,815 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-23 02:04:02,815 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-23 02:04:02,815 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-23 02:04:02,815 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-23 02:04:02,816 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-23 02:04:02,816 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-23 02:04:02,816 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-23 02:04:02,816 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-23 02:04:02,816 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-23 02:04:02,817 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-23 02:04:02,817 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-23 02:04:02,817 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-23 02:04:02,817 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-23 02:04:02,817 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-23 02:04:02,818 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-23 02:04:02,818 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-23 02:04:02,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,818 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,819 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,820 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,824 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,824 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-23 02:04:02,825 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-23 02:04:02,825 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-23 02:04:02,825 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-23 02:04:02,825 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-23 02:04:02,825 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-23 02:04:02,826 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-23 02:04:02,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,826 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:04:02,826 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-23 02:04:02,829 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-23 02:04:02,875 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:04:02,881 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-23 02:04:02,882 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-23 02:04:02,898 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-23 02:04:02,915 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-23 02:04:02,919 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-23 02:04:02,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2021-11-23 02:04:02,986 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2021-11-23 02:04:02,987 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-23 02:04:02,996 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-23 02:04:03,009 INFO L116 LiptonReduction]: Number of co-enabled transitions 4864 [2021-11-23 02:04:05,741 INFO L131 LiptonReduction]: Checked pairs total: 16173 [2021-11-23 02:04:05,741 INFO L133 LiptonReduction]: Total number of compositions: 75 [2021-11-23 02:04:05,770 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2021-11-23 02:04:05,820 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-23 02:04:05,825 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-23 02:04:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:04:05,836 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:05,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:05,837 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-23 02:04:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2114734191, now seen corresponding path program 1 times [2021-11-23 02:04:05,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:05,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526262776] [2021-11-23 02:04:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:05,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:06,057 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-23 02:04:06,058 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:06,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526262776] [2021-11-23 02:04:06,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526262776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:06,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:04:06,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:04:06,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054942877] [2021-11-23 02:04:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:06,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:04:06,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:06,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:04:06,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:04:06,115 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-23 02:04:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:06,262 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2021-11-23 02:04:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:04:06,273 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-23 02:04:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:06,306 INFO L225 Difference]: With dead ends: 596 [2021-11-23 02:04:06,307 INFO L226 Difference]: Without dead ends: 596 [2021-11-23 02:04:06,308 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-23 02:04:06,319 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 02:04:06,320 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-23 02:04:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-23 02:04:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-23 02:04:06,453 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-23 02:04:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2021-11-23 02:04:06,462 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2021-11-23 02:04:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:06,463 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2021-11-23 02:04:06,463 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-23 02:04:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2021-11-23 02:04:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 02:04:06,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:06,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:06,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:04:06,466 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-23 02:04:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:06,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1783178182, now seen corresponding path program 1 times [2021-11-23 02:04:06,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:06,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909679260] [2021-11-23 02:04:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:06,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:06,533 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-23 02:04:06,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909679260] [2021-11-23 02:04:06,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909679260] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200589076] [2021-11-23 02:04:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:06,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:06,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:06,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:06,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:04:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:06,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:04:06,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:06,689 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-23 02:04:06,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:06,754 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-23 02:04:06,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200589076] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [859899546] [2021-11-23 02:04:06,763 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-23 02:04:06,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:06,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-23 02:04:06,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540953005] [2021-11-23 02:04:06,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:06,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:04:06,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:06,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:04:06,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:04:06,769 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-23 02:04:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:06,874 INFO L93 Difference]: Finished difference Result 599 states and 1192 transitions. [2021-11-23 02:04:06,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:06,875 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-23 02:04:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:06,880 INFO L225 Difference]: With dead ends: 599 [2021-11-23 02:04:06,880 INFO L226 Difference]: Without dead ends: 599 [2021-11-23 02:04:06,880 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-23 02:04:06,890 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 02:04:06,891 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-23 02:04:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-23 02:04:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-23 02:04:06,922 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-23 02:04:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1192 transitions. [2021-11-23 02:04:06,926 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1192 transitions. Word has length 12 [2021-11-23 02:04:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:06,927 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1192 transitions. [2021-11-23 02:04:06,927 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-23 02:04:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1192 transitions. [2021-11-23 02:04:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:04:06,929 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:06,929 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:06,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:07,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:07,155 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-23 02:04:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash -336848431, now seen corresponding path program 2 times [2021-11-23 02:04:07,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:07,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97782857] [2021-11-23 02:04:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:07,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:07,285 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-23 02:04:07,286 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:07,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97782857] [2021-11-23 02:04:07,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97782857] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:07,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26669351] [2021-11-23 02:04:07,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:04:07,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:07,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:07,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:04:07,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:04:07,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:04:07,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:04:07,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:07,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:04:07,495 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 02:04:07,497 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-23 02:04:07,569 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-23 02:04:07,569 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-23 02:04:07,647 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-23 02:04:07,648 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-23 02:04:07,695 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-23 02:04:07,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:04:07,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26669351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:07,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:04:07,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2021-11-23 02:04:07,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906515242] [2021-11-23 02:04:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:07,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:07,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:04:07,699 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-23 02:04:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:08,441 INFO L93 Difference]: Finished difference Result 790 states and 1574 transitions. [2021-11-23 02:04:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:08,444 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-23 02:04:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:08,453 INFO L225 Difference]: With dead ends: 790 [2021-11-23 02:04:08,453 INFO L226 Difference]: Without dead ends: 790 [2021-11-23 02:04:08,454 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-23 02:04:08,461 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:08,466 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.7s Time] [2021-11-23 02:04:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-11-23 02:04:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 726. [2021-11-23 02:04:08,502 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-23 02:04:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1446 transitions. [2021-11-23 02:04:08,508 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1446 transitions. Word has length 15 [2021-11-23 02:04:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:08,509 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1446 transitions. [2021-11-23 02:04:08,509 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-23 02:04:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1446 transitions. [2021-11-23 02:04:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:04:08,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:08,513 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:08,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:08,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:08,741 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-23 02:04:08,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash 202679984, now seen corresponding path program 1 times [2021-11-23 02:04:08,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:08,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387608799] [2021-11-23 02:04:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:08,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:08,803 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-23 02:04:08,803 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:08,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387608799] [2021-11-23 02:04:08,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387608799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:08,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:04:08,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:04:08,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393133232] [2021-11-23 02:04:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:08,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:04:08,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:04:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:04:08,806 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-23 02:04:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:08,890 INFO L93 Difference]: Finished difference Result 1028 states and 2050 transitions. [2021-11-23 02:04:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:04:08,891 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-23 02:04:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:08,900 INFO L225 Difference]: With dead ends: 1028 [2021-11-23 02:04:08,901 INFO L226 Difference]: Without dead ends: 1028 [2021-11-23 02:04:08,901 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-23 02:04:08,903 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-23 02:04:08,904 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-23 02:04:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-23 02:04:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 743. [2021-11-23 02:04:08,937 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-23 02:04:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1480 transitions. [2021-11-23 02:04:08,943 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1480 transitions. Word has length 15 [2021-11-23 02:04:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:08,944 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1480 transitions. [2021-11-23 02:04:08,944 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-23 02:04:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1480 transitions. [2021-11-23 02:04:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:04:08,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:08,946 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:08,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:04:08,947 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-23 02:04:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2013723712, now seen corresponding path program 1 times [2021-11-23 02:04:08,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:08,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857700302] [2021-11-23 02:04:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:08,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:09,064 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-23 02:04:09,064 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857700302] [2021-11-23 02:04:09,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857700302] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758098148] [2021-11-23 02:04:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:09,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:09,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:09,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:04:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:09,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:04:09,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:09,183 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-23 02:04:09,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:09,276 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-23 02:04:09,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758098148] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1026148108] [2021-11-23 02:04:09,277 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-23 02:04:09,279 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:09,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-23 02:04:09,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384149642] [2021-11-23 02:04:09,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:09,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 02:04:09,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:09,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 02:04:09,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:04:09,282 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-23 02:04:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:09,395 INFO L93 Difference]: Finished difference Result 749 states and 1486 transitions. [2021-11-23 02:04:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:04:09,396 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-23 02:04:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:09,403 INFO L225 Difference]: With dead ends: 749 [2021-11-23 02:04:09,404 INFO L226 Difference]: Without dead ends: 749 [2021-11-23 02:04:09,405 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-23 02:04:09,406 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-23 02:04:09,407 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-23 02:04:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-23 02:04:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2021-11-23 02:04:09,457 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-23 02:04:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1486 transitions. [2021-11-23 02:04:09,462 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1486 transitions. Word has length 15 [2021-11-23 02:04:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:09,463 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 1486 transitions. [2021-11-23 02:04:09,463 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-23 02:04:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1486 transitions. [2021-11-23 02:04:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 02:04:09,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:09,465 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:04:09,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:09,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:09,689 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-23 02:04:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:09,689 INFO L85 PathProgramCache]: Analyzing trace with hash -805061856, now seen corresponding path program 2 times [2021-11-23 02:04:09,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:09,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867151369] [2021-11-23 02:04:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:09,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:09,889 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-23 02:04:09,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867151369] [2021-11-23 02:04:09,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867151369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:09,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:04:09,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:04:09,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117497874] [2021-11-23 02:04:09,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:09,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:09,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:04:09,893 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-23 02:04:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:10,366 INFO L93 Difference]: Finished difference Result 839 states and 1666 transitions. [2021-11-23 02:04:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:10,367 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-23 02:04:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:10,375 INFO L225 Difference]: With dead ends: 839 [2021-11-23 02:04:10,376 INFO L226 Difference]: Without dead ends: 839 [2021-11-23 02:04:10,376 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-23 02:04:10,378 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-23 02:04:10,379 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-23 02:04:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-23 02:04:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 807. [2021-11-23 02:04:10,413 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-23 02:04:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1602 transitions. [2021-11-23 02:04:10,419 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1602 transitions. Word has length 21 [2021-11-23 02:04:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:10,420 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1602 transitions. [2021-11-23 02:04:10,420 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-23 02:04:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1602 transitions. [2021-11-23 02:04:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 02:04:10,424 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:10,425 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-23 02:04:10,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 02:04:10,425 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-23 02:04:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2074507123, now seen corresponding path program 1 times [2021-11-23 02:04:10,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:10,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946882653] [2021-11-23 02:04:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:10,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:10,568 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-23 02:04:10,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:10,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946882653] [2021-11-23 02:04:10,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946882653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:10,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:04:10,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:04:10,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793856783] [2021-11-23 02:04:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:10,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:10,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:10,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:10,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:04:10,572 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-23 02:04:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:11,372 INFO L93 Difference]: Finished difference Result 967 states and 1922 transitions. [2021-11-23 02:04:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:11,373 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-23 02:04:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:11,381 INFO L225 Difference]: With dead ends: 967 [2021-11-23 02:04:11,381 INFO L226 Difference]: Without dead ends: 935 [2021-11-23 02:04:11,382 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-23 02:04:11,383 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:11,383 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.8s Time] [2021-11-23 02:04:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-23 02:04:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 902. [2021-11-23 02:04:11,419 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-23 02:04:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1788 transitions. [2021-11-23 02:04:11,426 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1788 transitions. Word has length 27 [2021-11-23 02:04:11,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:11,427 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1788 transitions. [2021-11-23 02:04:11,427 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-23 02:04:11,427 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1788 transitions. [2021-11-23 02:04:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 02:04:11,428 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:11,429 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-23 02:04:11,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 02:04:11,429 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-23 02:04:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -444468531, now seen corresponding path program 1 times [2021-11-23 02:04:11,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:11,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223312670] [2021-11-23 02:04:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:11,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:11,543 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-23 02:04:11,544 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:11,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223312670] [2021-11-23 02:04:11,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223312670] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:11,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:04:11,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:04:11,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633894906] [2021-11-23 02:04:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:11,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:11,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:11,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:04:11,547 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-23 02:04:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:11,867 INFO L93 Difference]: Finished difference Result 967 states and 1918 transitions. [2021-11-23 02:04:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:11,867 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-23 02:04:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:11,875 INFO L225 Difference]: With dead ends: 967 [2021-11-23 02:04:11,875 INFO L226 Difference]: Without dead ends: 967 [2021-11-23 02:04:11,875 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-23 02:04:11,876 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-23 02:04:11,876 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-23 02:04:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-11-23 02:04:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-11-23 02:04:11,910 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-23 02:04:11,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1918 transitions. [2021-11-23 02:04:11,916 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1918 transitions. Word has length 27 [2021-11-23 02:04:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:11,917 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1918 transitions. [2021-11-23 02:04:11,917 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-23 02:04:11,917 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1918 transitions. [2021-11-23 02:04:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:04:11,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:11,919 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-23 02:04:11,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 02:04:11,920 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-23 02:04:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1511693174, now seen corresponding path program 1 times [2021-11-23 02:04:11,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:11,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533355883] [2021-11-23 02:04:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:11,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:12,103 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-23 02:04:12,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:12,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533355883] [2021-11-23 02:04:12,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533355883] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:12,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785785696] [2021-11-23 02:04:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:12,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:12,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:12,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:04:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:12,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:04:12,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:12,287 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-23 02:04:12,343 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-23 02:04:12,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:04:12,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785785696] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:12,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:04:12,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:04:12,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472076534] [2021-11-23 02:04:12,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:12,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:12,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:04:12,346 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-23 02:04:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:12,529 INFO L93 Difference]: Finished difference Result 2184 states and 4322 transitions. [2021-11-23 02:04:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:12,530 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-23 02:04:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:12,547 INFO L225 Difference]: With dead ends: 2184 [2021-11-23 02:04:12,548 INFO L226 Difference]: Without dead ends: 2184 [2021-11-23 02:04:12,548 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-23 02:04:12,549 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.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:12,549 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.2s Time] [2021-11-23 02:04:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-11-23 02:04:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1024. [2021-11-23 02:04:12,597 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-23 02:04:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2006 transitions. [2021-11-23 02:04:12,603 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2006 transitions. Word has length 31 [2021-11-23 02:04:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:12,604 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2006 transitions. [2021-11-23 02:04:12,604 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-23 02:04:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2006 transitions. [2021-11-23 02:04:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:04:12,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:12,606 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-23 02:04:12,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:12,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:12,826 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-23 02:04:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -782408396, now seen corresponding path program 2 times [2021-11-23 02:04:12,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:12,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917338607] [2021-11-23 02:04:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:12,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:13,013 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-23 02:04:13,014 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917338607] [2021-11-23 02:04:13,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917338607] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:13,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920431545] [2021-11-23 02:04:13,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:04:13,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:13,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:13,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:04:13,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:04:13,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:04:13,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:04:13,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:13,174 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-23 02:04:13,256 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-23 02:04:13,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:04:13,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920431545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:13,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:04:13,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:04:13,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280141957] [2021-11-23 02:04:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:13,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:13,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:04:13,260 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-23 02:04:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:13,499 INFO L93 Difference]: Finished difference Result 2484 states and 4895 transitions. [2021-11-23 02:04:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:13,500 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-23 02:04:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:13,522 INFO L225 Difference]: With dead ends: 2484 [2021-11-23 02:04:13,523 INFO L226 Difference]: Without dead ends: 2484 [2021-11-23 02:04:13,523 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-23 02:04:13,524 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 170 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:13,525 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.2s Time] [2021-11-23 02:04:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-11-23 02:04:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1037. [2021-11-23 02:04:13,608 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-23 02:04:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2032 transitions. [2021-11-23 02:04:13,613 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2032 transitions. Word has length 31 [2021-11-23 02:04:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:13,614 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 2032 transitions. [2021-11-23 02:04:13,614 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-23 02:04:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2032 transitions. [2021-11-23 02:04:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:04:13,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:13,616 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-23 02:04:13,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:13,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:13,845 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-23 02:04:13,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1917489978, now seen corresponding path program 3 times [2021-11-23 02:04:13,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:13,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078663533] [2021-11-23 02:04:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:13,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:14,025 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-23 02:04:14,025 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:14,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078663533] [2021-11-23 02:04:14,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078663533] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:14,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268224058] [2021-11-23 02:04:14,026 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:04:14,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:14,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:14,027 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:14,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:04:14,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:04:14,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:04:14,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:04:14,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:14,238 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-23 02:04:14,298 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-23 02:04:14,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:04:14,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268224058] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:04:14,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:04:14,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:04:14,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876896820] [2021-11-23 02:04:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:04:14,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:04:14,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:14,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:04:14,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:04:14,301 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-23 02:04:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:14,482 INFO L93 Difference]: Finished difference Result 1904 states and 3740 transitions. [2021-11-23 02:04:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:04:14,485 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-23 02:04:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:14,502 INFO L225 Difference]: With dead ends: 1904 [2021-11-23 02:04:14,502 INFO L226 Difference]: Without dead ends: 1904 [2021-11-23 02:04:14,503 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-23 02:04:14,504 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-23 02:04:14,504 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-23 02:04:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-11-23 02:04:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1049. [2021-11-23 02:04:14,553 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-23 02:04:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2056 transitions. [2021-11-23 02:04:14,559 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2056 transitions. Word has length 31 [2021-11-23 02:04:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:14,559 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 2056 transitions. [2021-11-23 02:04:14,559 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-23 02:04:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2056 transitions. [2021-11-23 02:04:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 02:04:14,562 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:14,562 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-23 02:04:14,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:14,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:14,789 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-23 02:04:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash -643420328, now seen corresponding path program 1 times [2021-11-23 02:04:14,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:14,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12392781] [2021-11-23 02:04:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:14,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:14,873 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-23 02:04:14,874 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:14,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12392781] [2021-11-23 02:04:14,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12392781] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:14,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775492008] [2021-11-23 02:04:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:14,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:14,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:14,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:04:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:14,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:04:14,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:15,043 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-23 02:04:15,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:15,136 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-23 02:04:15,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775492008] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:15,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227055205] [2021-11-23 02:04:15,138 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-23 02:04:15,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:15,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-23 02:04:15,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034079696] [2021-11-23 02:04:15,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:15,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:04:15,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:04:15,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:04:15,142 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-23 02:04:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:15,288 INFO L93 Difference]: Finished difference Result 2629 states and 5216 transitions. [2021-11-23 02:04:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:04:15,289 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-23 02:04:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:15,312 INFO L225 Difference]: With dead ends: 2629 [2021-11-23 02:04:15,312 INFO L226 Difference]: Without dead ends: 2629 [2021-11-23 02:04:15,312 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-23 02:04:15,313 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-23 02:04:15,314 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-23 02:04:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2021-11-23 02:04:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2494. [2021-11-23 02:04:15,420 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-23 02:04:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2021-11-23 02:04:15,432 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2021-11-23 02:04:15,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:15,433 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2021-11-23 02:04:15,433 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-23 02:04:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2021-11-23 02:04:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:04:15,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:15,436 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-23 02:04:15,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:15,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-23 02:04:15,651 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-23 02:04:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -329216545, now seen corresponding path program 1 times [2021-11-23 02:04:15,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189864925] [2021-11-23 02:04:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:15,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:16,152 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-23 02:04:16,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:16,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189864925] [2021-11-23 02:04:16,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189864925] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:16,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167010006] [2021-11-23 02:04:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:16,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:16,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:16,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:16,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:04:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:16,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-23 02:04:16,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:16,902 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-23 02:04:16,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:16,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, 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-23 02:04:17,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,070 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-23 02:04:17,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,182 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-23 02:04:17,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:17,367 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-23 02:04:17,369 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-23 02:04:17,497 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-23 02:04:17,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:17,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:17,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:18,578 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-23 02:04:18,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167010006] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:18,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848030542] [2021-11-23 02:04:18,580 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-23 02:04:18,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:18,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:04:18,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654881635] [2021-11-23 02:04:18,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:18,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:04:18,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:18,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:04:18,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:04:18,585 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-23 02:04:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:24,542 INFO L93 Difference]: Finished difference Result 10550 states and 21429 transitions. [2021-11-23 02:04:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 02:04:24,542 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-23 02:04:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:24,597 INFO L225 Difference]: With dead ends: 10550 [2021-11-23 02:04:24,598 INFO L226 Difference]: Without dead ends: 10550 [2021-11-23 02:04:24,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=595, Invalid=2267, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:04:24,600 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 872 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 4.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:24,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 245 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2936 Invalid, 0 Unknown, 35 Unchecked, 4.0s Time] [2021-11-23 02:04:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10550 states. [2021-11-23 02:04:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10550 to 6001. [2021-11-23 02:04:24,890 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-23 02:04:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 12863 transitions. [2021-11-23 02:04:24,962 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 12863 transitions. Word has length 45 [2021-11-23 02:04:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:24,962 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 12863 transitions. [2021-11-23 02:04:24,962 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-23 02:04:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 12863 transitions. [2021-11-23 02:04:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:04:24,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:24,967 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-23 02:04:25,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:25,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 02:04:25,177 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-23 02:04:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1700766169, now seen corresponding path program 1 times [2021-11-23 02:04:25,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:25,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995677560] [2021-11-23 02:04:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:25,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:25,533 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-23 02:04:25,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995677560] [2021-11-23 02:04:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995677560] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:25,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427762762] [2021-11-23 02:04:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:25,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:25,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:25,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:25,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:04:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:25,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:04:25,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:26,105 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-23 02:04:26,174 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-23 02:04:26,175 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-23 02:04:26,222 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 02:04:26,223 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-23 02:04:26,284 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-23 02:04:26,284 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-23 02:04:26,391 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-23 02:04:26,392 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-23 02:04:26,467 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-23 02:04:26,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:26,604 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-23 02:04:26,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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 29 [2021-11-23 02:04:26,607 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-23 02:04:26,610 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-23 02:04:26,849 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-23 02:04:26,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427762762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:26,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1400877108] [2021-11-23 02:04:26,850 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-23 02:04:26,851 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:26,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-23 02:04:26,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132645109] [2021-11-23 02:04:26,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:26,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:04:26,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:26,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:04:26,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:04:26,853 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-23 02:04:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:04:34,639 INFO L93 Difference]: Finished difference Result 12679 states and 25789 transitions. [2021-11-23 02:04:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-23 02:04:34,640 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-23 02:04:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:04:34,686 INFO L225 Difference]: With dead ends: 12679 [2021-11-23 02:04:34,686 INFO L226 Difference]: Without dead ends: 12679 [2021-11-23 02:04:34,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2220, Invalid=9336, Unknown=0, NotChecked=0, Total=11556 [2021-11-23 02:04:34,692 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1333 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 6625 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:04:34,692 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.6s Time] [2021-11-23 02:04:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2021-11-23 02:04:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 6071. [2021-11-23 02:04:35,006 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-23 02:04:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13003 transitions. [2021-11-23 02:04:35,052 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13003 transitions. Word has length 45 [2021-11-23 02:04:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:04:35,053 INFO L470 AbstractCegarLoop]: Abstraction has 6071 states and 13003 transitions. [2021-11-23 02:04:35,054 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-23 02:04:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13003 transitions. [2021-11-23 02:04:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:04:35,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:04:35,059 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-23 02:04:35,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:04:35,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:35,272 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-23 02:04:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:04:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1883138674, now seen corresponding path program 1 times [2021-11-23 02:04:35,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:04:35,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171675542] [2021-11-23 02:04:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:35,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:04:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:36,307 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-23 02:04:36,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:04:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171675542] [2021-11-23 02:04:36,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171675542] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:04:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103452894] [2021-11-23 02:04:36,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:04:36,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:04:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:04:36,309 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:04:36,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:04:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:04:36,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 02:04:36,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:04:36,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, 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-23 02:04:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:36,989 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-23 02:04:37,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,073 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-23 02:04:37,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,174 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-23 02:04:37,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,290 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-23 02:04:37,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,421 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-23 02:04:37,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,581 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-23 02:04:37,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:37,778 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-23 02:04:38,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:04:38,285 INFO L354 Elim1Store]: treesize reduction 615, result has 10.7 percent of original size [2021-11-23 02:04:38,286 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-23 02:04:50,461 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-23 02:04:50,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:04:53,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:04:53,713 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-23 02:04:53,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103452894] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:04:53,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [647316347] [2021-11-23 02:04:53,713 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-23 02:04:53,714 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:04:53,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-23 02:04:53,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466692697] [2021-11-23 02:04:53,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:04:53,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-23 02:04:53,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:04:53,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-23 02:04:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1191, Unknown=5, NotChecked=0, Total=1482 [2021-11-23 02:04:53,717 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-23 02:05:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:05:26,650 INFO L93 Difference]: Finished difference Result 12223 states and 24898 transitions. [2021-11-23 02:05:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-23 02:05:26,651 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-23 02:05:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:05:26,699 INFO L225 Difference]: With dead ends: 12223 [2021-11-23 02:05:26,699 INFO L226 Difference]: Without dead ends: 12223 [2021-11-23 02:05:26,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=1207, Invalid=4478, Unknown=15, NotChecked=0, Total=5700 [2021-11-23 02:05:26,707 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.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:05:26,708 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.3s Time] [2021-11-23 02:05:26,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2021-11-23 02:05:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 6268. [2021-11-23 02:05:26,988 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-23 02:05:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13409 transitions. [2021-11-23 02:05:27,007 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13409 transitions. Word has length 45 [2021-11-23 02:05:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:05:27,007 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 13409 transitions. [2021-11-23 02:05:27,008 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-23 02:05:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13409 transitions. [2021-11-23 02:05:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:05:27,013 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:05:27,013 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-23 02:05:27,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:05:27,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-23 02:05:27,229 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-23 02:05:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:05:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2029288535, now seen corresponding path program 1 times [2021-11-23 02:05:27,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:05:27,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955887247] [2021-11-23 02:05:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:05:27,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:05:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:05:27,717 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-23 02:05:27,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:05:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955887247] [2021-11-23 02:05:27,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955887247] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:05:27,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259742573] [2021-11-23 02:05:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:05:27,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:05:27,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:05:27,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:05:27,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:05:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:05:27,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:05:27,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:05:28,218 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-23 02:05:28,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,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 21 treesize of output 20 [2021-11-23 02:05:28,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,317 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-23 02:05:28,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:28,396 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-23 02:05:28,542 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:05:28,543 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-23 02:05:28,635 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-23 02:05:28,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:05:29,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:29,527 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-23 02:05:29,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259742573] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:05:29,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002804814] [2021-11-23 02:05:29,528 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-23 02:05:29,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:05:29,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:05:29,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757843498] [2021-11-23 02:05:29,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:05:29,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:05:29,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:05:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:05:29,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:05:29,531 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-23 02:05:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:05:39,686 INFO L93 Difference]: Finished difference Result 12441 states and 25326 transitions. [2021-11-23 02:05:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-23 02:05:39,687 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-23 02:05:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:05:39,718 INFO L225 Difference]: With dead ends: 12441 [2021-11-23 02:05:39,719 INFO L226 Difference]: Without dead ends: 12441 [2021-11-23 02:05:39,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1544, Invalid=6646, Unknown=0, NotChecked=0, Total=8190 [2021-11-23 02:05:39,723 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1191 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s 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, 6.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:05:39,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 293 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5144 Invalid, 0 Unknown, 82 Unchecked, 6.7s Time] [2021-11-23 02:05:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12441 states. [2021-11-23 02:05:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12441 to 6478. [2021-11-23 02:05:39,980 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-23 02:05:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 13845 transitions. [2021-11-23 02:05:39,998 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 13845 transitions. Word has length 45 [2021-11-23 02:05:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:05:39,999 INFO L470 AbstractCegarLoop]: Abstraction has 6478 states and 13845 transitions. [2021-11-23 02:05:39,999 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-23 02:05:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 13845 transitions. [2021-11-23 02:05:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:05:40,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:05:40,003 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-23 02:05:40,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:05:40,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 02:05:40,221 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-23 02:05:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:05:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash -873806249, now seen corresponding path program 2 times [2021-11-23 02:05:40,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:05:40,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423230770] [2021-11-23 02:05:40,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:05:40,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:05:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:05:40,510 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-23 02:05:40,511 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:05:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423230770] [2021-11-23 02:05:40,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423230770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:05:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349347164] [2021-11-23 02:05:40,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:05:40,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:05:40,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:05:40,522 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:05:40,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:05:40,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:05:40,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:05:40,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:05:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:05:40,760 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-23 02:05:40,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:05:40,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:40,989 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-23 02:05:41,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,056 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-23 02:05:41,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:41,131 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-23 02:05:41,217 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-23 02:05:41,217 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-23 02:05:41,376 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-23 02:05:41,376 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-23 02:05:41,440 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-23 02:05:41,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:05:42,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:05:42,419 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-23 02:05:42,422 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-23 02:05:42,466 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-23 02:05:42,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349347164] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:05:42,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:05:42,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-23 02:05:42,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340367274] [2021-11-23 02:05:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:05:42,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:05:42,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:05:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:05:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2021-11-23 02:05:42,468 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-23 02:05:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:05:46,950 INFO L93 Difference]: Finished difference Result 8036 states and 17070 transitions. [2021-11-23 02:05:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:05:46,951 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-23 02:05:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:05:46,967 INFO L225 Difference]: With dead ends: 8036 [2021-11-23 02:05:46,967 INFO L226 Difference]: Without dead ends: 8036 [2021-11-23 02:05:46,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=208, Invalid=913, Unknown=1, NotChecked=0, Total=1122 [2021-11-23 02:05:46,969 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.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:05:46,969 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.5s Time] [2021-11-23 02:05:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2021-11-23 02:05:47,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 6615. [2021-11-23 02:05:47,127 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-23 02:05:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 14143 transitions. [2021-11-23 02:05:47,146 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 14143 transitions. Word has length 45 [2021-11-23 02:05:47,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:05:47,146 INFO L470 AbstractCegarLoop]: Abstraction has 6615 states and 14143 transitions. [2021-11-23 02:05:47,146 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-23 02:05:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 14143 transitions. [2021-11-23 02:05:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:05:47,150 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:05:47,150 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-23 02:05:47,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:05:47,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:05:47,365 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-23 02:05:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:05:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -799626659, now seen corresponding path program 3 times [2021-11-23 02:05:47,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:05:47,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138976945] [2021-11-23 02:05:47,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:05:47,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:05:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:05:47,744 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-23 02:05:47,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:05:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138976945] [2021-11-23 02:05:47,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138976945] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:05:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558251160] [2021-11-23 02:05:47,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:05:47,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:05:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:05:47,746 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:05:47,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:05:47,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:05:47,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:05:47,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:05:47,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:05:48,292 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-23 02:05:48,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,348 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-23 02:05:48,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,423 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-23 02:05:48,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:05:48,570 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-23 02:05:48,687 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:05:48,687 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-23 02:05:48,792 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-23 02:05:48,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:05:50,818 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-23 02:06:03,735 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-23 02:06:05,850 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-23 02:06:05,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558251160] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:06:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293922605] [2021-11-23 02:06:05,851 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-23 02:06:05,853 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:06:05,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:06:05,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274461647] [2021-11-23 02:06:05,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:06:05,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:06:05,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:06:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:06:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=746, Unknown=8, NotChecked=114, Total=992 [2021-11-23 02:06:05,855 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-23 02:06:07,651 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-23 02:06:08,840 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-23 02:06:12,086 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-23 02:06:13,146 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-23 02:06:21,739 WARN L227 SmtUtils]: Spent 7.73s 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-23 02:06:23,527 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|))) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-23 02:07:06,728 WARN L227 SmtUtils]: Spent 5.81s 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-23 02:07:29,262 WARN L227 SmtUtils]: Spent 6.59s 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-23 02:07:30,891 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) (< 0 .cse0) (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|))))) is different from false [2021-11-23 02:07:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:07:31,013 INFO L93 Difference]: Finished difference Result 22647 states and 47320 transitions. [2021-11-23 02:07:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-11-23 02:07:31,013 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-23 02:07:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:07:31,044 INFO L225 Difference]: With dead ends: 22647 [2021-11-23 02:07:31,045 INFO L226 Difference]: Without dead ends: 22647 [2021-11-23 02:07:31,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2217 ImplicationChecksByTransitivity, 98.3s TimeCoverageRelationStatistics Valid=899, Invalid=5583, Unknown=30, NotChecked=1320, Total=7832 [2021-11-23 02:07:31,047 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 972 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 7211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3254 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:07:31,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [972 Valid, 578 Invalid, 7211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 3810 Invalid, 0 Unknown, 3254 Unchecked, 3.7s Time] [2021-11-23 02:07:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22647 states. [2021-11-23 02:07:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22647 to 12486. [2021-11-23 02:07:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12486 states, 12473 states have (on average 2.1740559608754912) internal successors, (27117), 12485 states have internal predecessors, (27117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:07:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12486 states to 12486 states and 27117 transitions. [2021-11-23 02:07:31,451 INFO L78 Accepts]: Start accepts. Automaton has 12486 states and 27117 transitions. Word has length 45 [2021-11-23 02:07:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:07:31,451 INFO L470 AbstractCegarLoop]: Abstraction has 12486 states and 27117 transitions. [2021-11-23 02:07:31,451 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-23 02:07:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 12486 states and 27117 transitions. [2021-11-23 02:07:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:07:31,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:07:31,455 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-23 02:07:31,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:07:31,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 02:07:31,678 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-23 02:07:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:07:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1527646261, now seen corresponding path program 4 times [2021-11-23 02:07:31,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:07:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136501569] [2021-11-23 02:07:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:07:31,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:07:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:07:32,028 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-23 02:07:32,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:07:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136501569] [2021-11-23 02:07:32,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136501569] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:07:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700997773] [2021-11-23 02:07:32,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:07:32,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:07:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:07:32,031 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:07:32,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:07:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:07:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:07:32,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:07:32,443 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-23 02:07:32,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,485 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-23 02:07:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,597 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-23 02:07:32,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:07:32,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, 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-23 02:07:32,931 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:07:32,931 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-23 02:07:32,994 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-23 02:07:32,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:07:55,678 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-23 02:07:55,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700997773] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:07:55,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [576322765] [2021-11-23 02:07:55,679 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-23 02:07:55,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:07:55,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:07:55,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392554990] [2021-11-23 02:07:55,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:07:55,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:07:55,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:07:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:07:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=846, Unknown=13, NotChecked=0, Total=992 [2021-11-23 02:07:55,683 INFO L87 Difference]: Start difference. First operand 12486 states and 27117 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-23 02:08:22,850 WARN L227 SmtUtils]: Spent 21.40s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:08:33,201 WARN L227 SmtUtils]: Spent 6.71s 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-23 02:08:45,803 WARN L227 SmtUtils]: Spent 6.37s 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-23 02:08:55,108 WARN L227 SmtUtils]: Spent 7.20s 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-23 02:09:06,909 WARN L227 SmtUtils]: Spent 6.15s 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-23 02:09:33,308 WARN L227 SmtUtils]: Spent 20.27s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:09:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:09:34,467 INFO L93 Difference]: Finished difference Result 27145 states and 58025 transitions. [2021-11-23 02:09:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-23 02:09:34,467 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-23 02:09:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:09:34,512 INFO L225 Difference]: With dead ends: 27145 [2021-11-23 02:09:34,512 INFO L226 Difference]: Without dead ends: 27145 [2021-11-23 02:09:34,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 118.1s TimeCoverageRelationStatistics Valid=1600, Invalid=6748, Unknown=24, NotChecked=0, Total=8372 [2021-11-23 02:09:34,515 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 914 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 3363 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 3363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:09:34,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 394 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 3363 Invalid, 0 Unknown, 814 Unchecked, 3.2s Time] [2021-11-23 02:09:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27145 states. [2021-11-23 02:09:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27145 to 19166. [2021-11-23 02:09:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19166 states, 19153 states have (on average 2.1895786560852084) internal successors, (41937), 19165 states have internal predecessors, (41937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:09:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19166 states to 19166 states and 41937 transitions. [2021-11-23 02:09:35,101 INFO L78 Accepts]: Start accepts. Automaton has 19166 states and 41937 transitions. Word has length 45 [2021-11-23 02:09:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:09:35,101 INFO L470 AbstractCegarLoop]: Abstraction has 19166 states and 41937 transitions. [2021-11-23 02:09:35,102 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-23 02:09:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19166 states and 41937 transitions. [2021-11-23 02:09:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:09:35,105 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:09:35,105 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-23 02:09:35,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:09:35,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:09:35,318 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-23 02:09:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:09:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1517537279, now seen corresponding path program 5 times [2021-11-23 02:09:35,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:09:35,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316914533] [2021-11-23 02:09:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:09:35,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:09:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:09:35,616 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-23 02:09:35,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:09:35,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316914533] [2021-11-23 02:09:35,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316914533] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:09:35,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760673600] [2021-11-23 02:09:35,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:09:35,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:09:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:09:35,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:09:35,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:09:35,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:09:35,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:09:35,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:09:35,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:09:35,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-23 02:09:35,924 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-23 02:09:35,989 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-23 02:09:35,989 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-23 02:09:36,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,043 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-23 02:09:36,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,096 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-23 02:09:36,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:36,156 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-23 02:09:36,359 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-23 02:09:36,359 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-23 02:09:36,486 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-23 02:09:36,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:09:36,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,950 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:36,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:37,256 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-23 02:09:37,259 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-23 02:09:37,300 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-23 02:09:37,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760673600] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:09:37,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:09:37,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-23 02:09:37,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642786848] [2021-11-23 02:09:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:09:37,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:09:37,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:09:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:09:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:09:37,303 INFO L87 Difference]: Start difference. First operand 19166 states and 41937 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-23 02:09:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:09:41,530 INFO L93 Difference]: Finished difference Result 22199 states and 48362 transitions. [2021-11-23 02:09:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:09:41,531 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-23 02:09:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:09:41,566 INFO L225 Difference]: With dead ends: 22199 [2021-11-23 02:09:41,567 INFO L226 Difference]: Without dead ends: 22199 [2021-11-23 02:09:41,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 02:09:41,568 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:09:41,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 33 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-23 02:09:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22199 states. [2021-11-23 02:09:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22199 to 19321. [2021-11-23 02:09:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19321 states, 19308 states have (on average 2.188056764035633) internal successors, (42247), 19320 states have internal predecessors, (42247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:09:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19321 states to 19321 states and 42247 transitions. [2021-11-23 02:09:41,999 INFO L78 Accepts]: Start accepts. Automaton has 19321 states and 42247 transitions. Word has length 45 [2021-11-23 02:09:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:09:42,000 INFO L470 AbstractCegarLoop]: Abstraction has 19321 states and 42247 transitions. [2021-11-23 02:09:42,000 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-23 02:09:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19321 states and 42247 transitions. [2021-11-23 02:09:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:09:42,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:09:42,002 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-23 02:09:42,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:09:42,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:09:42,203 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-23 02:09:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:09:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1517924159, now seen corresponding path program 6 times [2021-11-23 02:09:42,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:09:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524115007] [2021-11-23 02:09:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:09:42,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:09:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:09:42,634 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-23 02:09:42,635 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:09:42,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524115007] [2021-11-23 02:09:42,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524115007] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:09:42,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797217860] [2021-11-23 02:09:42,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:09:42,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:09:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:09:42,636 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:09:42,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:09:42,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:09:42,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:09:42,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-23 02:09:42,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:09:43,377 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-23 02:09:43,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,452 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-23 02:09:43,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,498 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-23 02:09:43,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,589 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-23 02:09:43,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:43,655 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-23 02:09:43,697 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-23 02:09:43,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:09:44,037 INFO L354 Elim1Store]: treesize reduction 222, result has 16.2 percent of original size [2021-11-23 02:09:44,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 57 [2021-11-23 02:09:44,040 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-23 02:09:44,056 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-23 02:09:44,056 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-23 02:09:44,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,107 INFO L354 Elim1Store]: treesize reduction 109, result has 28.3 percent of original size [2021-11-23 02:09:44,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 02:09:44,115 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-23 02:09:44,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,122 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-23 02:09:44,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,162 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-23 02:09:44,162 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-23 02:09:44,171 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:09:44,171 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-23 02:09:44,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:44,197 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-23 02:09:44,198 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-23 02:09:44,483 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-23 02:09:44,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797217860] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:09:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064734007] [2021-11-23 02:09:44,485 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-23 02:09:44,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:09:44,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-23 02:09:44,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608259623] [2021-11-23 02:09:44,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:09:44,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:09:44,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:09:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:09:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:09:44,491 INFO L87 Difference]: Start difference. First operand 19321 states and 42247 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-23 02:09:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:09:55,768 INFO L93 Difference]: Finished difference Result 24390 states and 52233 transitions. [2021-11-23 02:09:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-23 02:09:55,769 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-23 02:09:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:09:55,804 INFO L225 Difference]: With dead ends: 24390 [2021-11-23 02:09:55,804 INFO L226 Difference]: Without dead ends: 24390 [2021-11-23 02:09:55,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2021-11-23 02:09:55,807 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 650 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 6076 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 6076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:09:55,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 355 Invalid, 6264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 6076 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2021-11-23 02:09:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24390 states. [2021-11-23 02:09:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24390 to 19363. [2021-11-23 02:09:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19363 states, 19350 states have (on average 2.1877519379844963) internal successors, (42333), 19362 states have internal predecessors, (42333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:09:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19363 states to 19363 states and 42333 transitions. [2021-11-23 02:09:56,390 INFO L78 Accepts]: Start accepts. Automaton has 19363 states and 42333 transitions. Word has length 45 [2021-11-23 02:09:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:09:56,391 INFO L470 AbstractCegarLoop]: Abstraction has 19363 states and 42333 transitions. [2021-11-23 02:09:56,392 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-23 02:09:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 19363 states and 42333 transitions. [2021-11-23 02:09:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:09:56,397 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:09:56,397 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-23 02:09:56,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:09:56,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-23 02:09:56,619 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-23 02:09:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:09:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1069772857, now seen corresponding path program 2 times [2021-11-23 02:09:56,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:09:56,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111184700] [2021-11-23 02:09:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:09:56,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:09:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:09:56,985 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-23 02:09:56,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:09:56,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111184700] [2021-11-23 02:09:56,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111184700] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:09:56,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546772431] [2021-11-23 02:09:56,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:09:56,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:09:56,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:09:56,987 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:09:56,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:09:57,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:09:57,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:09:57,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 02:09:57,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:09:57,470 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-23 02:09:57,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,507 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-23 02:09:57,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,555 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-23 02:09:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,621 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-23 02:09:57,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:09:57,726 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:09:57,727 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-23 02:09:57,799 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-23 02:09:57,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:09:58,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:09:58,585 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-23 02:09:58,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546772431] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:09:58,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238333774] [2021-11-23 02:09:58,586 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-23 02:09:58,586 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:09:58,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:09:58,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984264910] [2021-11-23 02:09:58,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:09:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:09:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:09:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:09:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:09:58,588 INFO L87 Difference]: Start difference. First operand 19363 states and 42333 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-23 02:10:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:10:03,038 INFO L93 Difference]: Finished difference Result 37397 states and 81042 transitions. [2021-11-23 02:10:03,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-23 02:10:03,038 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-23 02:10:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:10:03,101 INFO L225 Difference]: With dead ends: 37397 [2021-11-23 02:10:03,101 INFO L226 Difference]: Without dead ends: 37397 [2021-11-23 02:10:03,107 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-23 02:10:03,113 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 843 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 3916 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 4471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 3916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:10:03,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [843 Valid, 337 Invalid, 4471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 3916 Invalid, 0 Unknown, 372 Unchecked, 3.5s Time] [2021-11-23 02:10:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37397 states. [2021-11-23 02:10:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37397 to 24944. [2021-11-23 02:10:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24944 states, 24931 states have (on average 2.2011952990253096) internal successors, (54878), 24943 states have internal predecessors, (54878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:10:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24944 states to 24944 states and 54878 transitions. [2021-11-23 02:10:03,869 INFO L78 Accepts]: Start accepts. Automaton has 24944 states and 54878 transitions. Word has length 45 [2021-11-23 02:10:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:10:03,869 INFO L470 AbstractCegarLoop]: Abstraction has 24944 states and 54878 transitions. [2021-11-23 02:10:03,870 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-23 02:10:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 24944 states and 54878 transitions. [2021-11-23 02:10:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:10:03,873 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:10:03,873 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-23 02:10:03,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:10:04,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-23 02:10:04,101 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-23 02:10:04,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:10:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash -301776767, now seen corresponding path program 2 times [2021-11-23 02:10:04,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:10:04,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696744971] [2021-11-23 02:10:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:10:04,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:10:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:10:04,295 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-23 02:10:04,295 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:10:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696744971] [2021-11-23 02:10:04,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696744971] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:10:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106210272] [2021-11-23 02:10:04,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:10:04,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:10:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:10:04,298 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:10:04,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 02:10:04,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:10:04,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:10:04,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 02:10:04,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:10:04,855 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-23 02:10:04,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,885 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-23 02:10:04,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,909 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-23 02:10:04,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,943 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:10:04,944 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-23 02:10:04,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:04,986 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:10:04,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:10:05,122 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-23 02:10:05,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:10:06,632 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-23 02:10:06,649 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-23 02:10:06,649 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-23 02:10:06,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2021-11-23 02:10:06,654 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-23 02:10:06,821 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-23 02:10:06,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106210272] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:10:06,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281440532] [2021-11-23 02:10:06,821 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-23 02:10:06,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:10:06,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-23 02:10:06,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011279689] [2021-11-23 02:10:06,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:10:06,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:10:06,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:10:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:10:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2021-11-23 02:10:06,824 INFO L87 Difference]: Start difference. First operand 24944 states and 54878 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-23 02:10:09,707 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-23 02:10:13,661 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-23 02:10:16,622 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-23 02:10:18,726 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-23 02:10:20,781 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-23 02:10:24,543 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-23 02:10:26,229 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-23 02:10:28,306 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-23 02:10:32,537 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-23 02:10:37,015 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-23 02:10:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:10:38,494 INFO L93 Difference]: Finished difference Result 131992 states and 289222 transitions. [2021-11-23 02:10:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-11-23 02:10:38,495 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-23 02:10:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:10:39,095 INFO L225 Difference]: With dead ends: 131992 [2021-11-23 02:10:39,095 INFO L226 Difference]: Without dead ends: 131992 [2021-11-23 02:10:39,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 8068 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=2639, Invalid=17986, Unknown=11, NotChecked=3234, Total=23870 [2021-11-23 02:10:39,099 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1493 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 12617 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 13629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 12617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:10:39,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1493 Valid, 597 Invalid, 13629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 12617 Invalid, 0 Unknown, 596 Unchecked, 9.2s Time] [2021-11-23 02:10:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131992 states. [2021-11-23 02:10:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131992 to 61877. [2021-11-23 02:10:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61877 states, 61864 states have (on average 2.2154079917237812) internal successors, (137054), 61876 states have internal predecessors, (137054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:10:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61877 states to 61877 states and 137054 transitions. [2021-11-23 02:10:42,283 INFO L78 Accepts]: Start accepts. Automaton has 61877 states and 137054 transitions. Word has length 45 [2021-11-23 02:10:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:10:42,284 INFO L470 AbstractCegarLoop]: Abstraction has 61877 states and 137054 transitions. [2021-11-23 02:10:42,284 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-23 02:10:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61877 states and 137054 transitions. [2021-11-23 02:10:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:10:42,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:10:42,288 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-23 02:10:42,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-23 02:10:42,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:10:42,493 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-23 02:10:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:10:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -349144457, now seen corresponding path program 3 times [2021-11-23 02:10:42,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:10:42,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301828235] [2021-11-23 02:10:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:10:42,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:10:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:10:42,749 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-23 02:10:42,750 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:10:42,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301828235] [2021-11-23 02:10:42,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301828235] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:10:42,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398546667] [2021-11-23 02:10:42,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:10:42,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:10:42,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:10:42,752 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:10:42,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 02:10:43,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:10:43,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:10:43,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 02:10:43,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:10:43,596 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-23 02:10:43,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,646 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-23 02:10:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,725 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-23 02:10:43,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,786 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-23 02:10:43,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:43,865 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-23 02:10:43,924 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-23 02:10:43,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:10:44,171 INFO L354 Elim1Store]: treesize reduction 83, result has 25.9 percent of original size [2021-11-23 02:10:44,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 43 [2021-11-23 02:10:44,174 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-23 02:10:44,179 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 02:10:44,179 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-23 02:10:44,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:10:44,219 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-23 02:10:44,220 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-23 02:10:44,223 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-23 02:10:44,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:10:44,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:10:44,229 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-23 02:10:44,529 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-23 02:10:44,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398546667] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:10:44,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271270877] [2021-11-23 02:10:44,530 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-23 02:10:44,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:10:44,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-23 02:10:44,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605845432] [2021-11-23 02:10:44,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:10:44,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-23 02:10:44,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:10:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-23 02:10:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-23 02:10:44,533 INFO L87 Difference]: Start difference. First operand 61877 states and 137054 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-23 02:10:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:10:52,058 INFO L93 Difference]: Finished difference Result 86532 states and 189934 transitions. [2021-11-23 02:10:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-23 02:10:52,059 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-23 02:10:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:10:52,377 INFO L225 Difference]: With dead ends: 86532 [2021-11-23 02:10:52,377 INFO L226 Difference]: Without dead ends: 86532 [2021-11-23 02:10:52,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1401, Invalid=5405, Unknown=0, NotChecked=0, Total=6806 [2021-11-23 02:10:52,378 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 912 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 5841 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 6665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 5841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:10:52,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [912 Valid, 395 Invalid, 6665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 5841 Invalid, 0 Unknown, 530 Unchecked, 4.9s Time] [2021-11-23 02:10:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86532 states. [2021-11-23 02:10:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86532 to 25652. [2021-11-23 02:10:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25652 states, 25639 states have (on average 2.200124809859979) internal successors, (56409), 25651 states have internal predecessors, (56409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:10:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25652 states to 25652 states and 56409 transitions. [2021-11-23 02:10:53,564 INFO L78 Accepts]: Start accepts. Automaton has 25652 states and 56409 transitions. Word has length 45 [2021-11-23 02:10:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:10:53,564 INFO L470 AbstractCegarLoop]: Abstraction has 25652 states and 56409 transitions. [2021-11-23 02:10:53,565 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-23 02:10:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 25652 states and 56409 transitions. [2021-11-23 02:10:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:10:53,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:10:53,568 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-23 02:10:53,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-23 02:10:53,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-23 02:10:53,778 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-23 02:10:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:10:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -484149272, now seen corresponding path program 2 times [2021-11-23 02:10:53,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:10:53,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469630331] [2021-11-23 02:10:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:10:53,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:10:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:10:54,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-23 02:10:54,497 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:10:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469630331] [2021-11-23 02:10:54,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469630331] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:10:54,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034919701] [2021-11-23 02:10:54,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:10:54,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:10:54,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:10:54,501 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:10:54,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 02:10:54,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:10:54,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:10:54,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-23 02:10:54,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:10:55,071 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-23 02:10:55,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,131 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-23 02:10:55,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-23 02:10:55,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,251 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-23 02:10:55,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,329 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-23 02:10:55,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,438 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-23 02:10:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,572 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-23 02:10:55,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,721 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-23 02:10:55,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:55,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:10:56,096 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:10:56,097 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-23 02:11:08,229 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-23 02:11:08,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:11:11,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:11,797 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-23 02:11:11,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034919701] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:11:11,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1255028606] [2021-11-23 02:11:11,799 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-23 02:11:11,800 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:11:11,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:11:11,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827520116] [2021-11-23 02:11:11,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:11:11,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:11:11,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:11:11,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:11:11,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1266, Unknown=5, NotChecked=0, Total=1560 [2021-11-23 02:11:11,802 INFO L87 Difference]: Start difference. First operand 25652 states and 56409 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-23 02:11:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:11:41,118 INFO L93 Difference]: Finished difference Result 42730 states and 92397 transitions. [2021-11-23 02:11:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-23 02:11:41,119 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-23 02:11:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:11:41,293 INFO L225 Difference]: With dead ends: 42730 [2021-11-23 02:11:41,293 INFO L226 Difference]: Without dead ends: 42730 [2021-11-23 02:11:41,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=1147, Invalid=4240, Unknown=15, NotChecked=0, Total=5402 [2021-11-23 02:11:41,295 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 905 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 7121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2971 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:11:41,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 357 Invalid, 7121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 3959 Invalid, 0 Unknown, 2971 Unchecked, 3.0s Time] [2021-11-23 02:11:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42730 states. [2021-11-23 02:11:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42730 to 26590. [2021-11-23 02:11:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26590 states, 26577 states have (on average 2.1949053693042857) internal successors, (58334), 26589 states have internal predecessors, (58334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:11:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26590 states to 26590 states and 58334 transitions. [2021-11-23 02:11:41,976 INFO L78 Accepts]: Start accepts. Automaton has 26590 states and 58334 transitions. Word has length 45 [2021-11-23 02:11:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:11:41,977 INFO L470 AbstractCegarLoop]: Abstraction has 26590 states and 58334 transitions. [2021-11-23 02:11:41,977 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-23 02:11:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 26590 states and 58334 transitions. [2021-11-23 02:11:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:11:41,980 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:11:41,980 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-23 02:11:42,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-23 02:11:42,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:11:42,192 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-23 02:11:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:11:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 679382453, now seen corresponding path program 7 times [2021-11-23 02:11:42,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:11:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044253526] [2021-11-23 02:11:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:11:42,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:11:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:11:42,596 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-23 02:11:42,596 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:11:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044253526] [2021-11-23 02:11:42,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044253526] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:11:42,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497012056] [2021-11-23 02:11:42,597 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:11:42,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:11:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:11:42,598 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:11:42,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 02:11:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:11:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:11:42,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:11:43,136 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-23 02:11:43,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,191 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-23 02:11:43,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,261 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-23 02:11:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:43,350 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-23 02:11:43,452 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:11:43,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 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-23 02:11:43,522 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-23 02:11:43,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:11:43,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:43,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:11:44,353 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-23 02:11:44,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497012056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:11:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646765747] [2021-11-23 02:11:44,354 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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-23 02:11:44,354 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:11:44,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:11:44,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934784307] [2021-11-23 02:11:44,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:11:44,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:11:44,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:11:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:11:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:11:44,356 INFO L87 Difference]: Start difference. First operand 26590 states and 58334 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-23 02:11:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:11:54,661 INFO L93 Difference]: Finished difference Result 39854 states and 85601 transitions. [2021-11-23 02:11:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-23 02:11:54,662 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-23 02:11:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:11:54,743 INFO L225 Difference]: With dead ends: 39854 [2021-11-23 02:11:54,743 INFO L226 Difference]: Without dead ends: 39854 [2021-11-23 02:11:54,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2245, Invalid=9097, Unknown=0, NotChecked=0, Total=11342 [2021-11-23 02:11:54,746 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1157 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 5854 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 6287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 5854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-23 02:11:54,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1157 Valid, 299 Invalid, 6287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 5854 Invalid, 0 Unknown, 148 Unchecked, 6.7s Time] [2021-11-23 02:11:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39854 states. [2021-11-23 02:11:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39854 to 29271. [2021-11-23 02:11:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29271 states, 29258 states have (on average 2.1795064597716864) internal successors, (63768), 29270 states have internal predecessors, (63768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:11:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29271 states to 29271 states and 63768 transitions. [2021-11-23 02:11:55,453 INFO L78 Accepts]: Start accepts. Automaton has 29271 states and 63768 transitions. Word has length 45 [2021-11-23 02:11:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:11:55,454 INFO L470 AbstractCegarLoop]: Abstraction has 29271 states and 63768 transitions. [2021-11-23 02:11:55,454 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-23 02:11:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29271 states and 63768 transitions. [2021-11-23 02:11:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:11:55,457 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:11:55,457 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-23 02:11:55,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-23 02:11:55,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 02:11:55,673 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-23 02:11:55,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:11:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash 911917160, now seen corresponding path program 3 times [2021-11-23 02:11:55,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:11:55,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033186584] [2021-11-23 02:11:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:11:55,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:11:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:11:56,543 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-23 02:11:56,543 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:11:56,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033186584] [2021-11-23 02:11:56,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033186584] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:11:56,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292155762] [2021-11-23 02:11:56,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:11:56,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:11:56,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:11:56,546 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:11:56,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-23 02:11:56,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:11:56,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:11:56,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-23 02:11:56,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:11:57,040 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-23 02:11:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,155 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-23 02:11:57,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,207 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-23 02:11:57,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,273 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-23 02:11:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,339 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-23 02:11:57,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,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-23 02:11:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,548 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-23 02:11:57,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,663 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-23 02:11:57,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:11:57,936 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:11:57,936 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-23 02:12:10,052 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-23 02:12:10,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:12:14,710 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-23 02:12:15,044 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-23 02:12:15,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292155762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:12:15,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1598174118] [2021-11-23 02:12:15,044 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-23 02:12:15,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:12:15,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:12:15,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066660290] [2021-11-23 02:12:15,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:12:15,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:12:15,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:12:15,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:12:15,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1223, Unknown=6, NotChecked=74, Total=1560 [2021-11-23 02:12:15,046 INFO L87 Difference]: Start difference. First operand 29271 states and 63768 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-23 02:12:17,409 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-23 02:12:45,046 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-23 02:12:57,335 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-23 02:12:59,056 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-23 02:12:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:12:59,999 INFO L93 Difference]: Finished difference Result 83349 states and 180092 transitions. [2021-11-23 02:12:59,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-23 02:12:59,999 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-23 02:12:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:13:00,208 INFO L225 Difference]: With dead ends: 83349 [2021-11-23 02:13:00,208 INFO L226 Difference]: Without dead ends: 83349 [2021-11-23 02:13:00,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 82 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2242 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=985, Invalid=5173, Unknown=24, NotChecked=790, Total=6972 [2021-11-23 02:13:00,209 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 626 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 6072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2989 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:13:00,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 705 Invalid, 6072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2973 Invalid, 0 Unknown, 2989 Unchecked, 2.2s Time] [2021-11-23 02:13:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83349 states. [2021-11-23 02:13:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83349 to 60922. [2021-11-23 02:13:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60922 states, 60909 states have (on average 2.1800883284900423) internal successors, (132787), 60921 states have internal predecessors, (132787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:13:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60922 states to 60922 states and 132787 transitions. [2021-11-23 02:13:02,158 INFO L78 Accepts]: Start accepts. Automaton has 60922 states and 132787 transitions. Word has length 45 [2021-11-23 02:13:02,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:13:02,158 INFO L470 AbstractCegarLoop]: Abstraction has 60922 states and 132787 transitions. [2021-11-23 02:13:02,158 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-23 02:13:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 60922 states and 132787 transitions. [2021-11-23 02:13:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:13:02,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:13:02,161 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-23 02:13:02,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-23 02:13:02,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 02:13:02,363 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-23 02:13:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:13:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -887758216, now seen corresponding path program 4 times [2021-11-23 02:13:02,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:13:02,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653306606] [2021-11-23 02:13:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:13:02,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:13:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:13:03,112 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-23 02:13:03,112 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:13:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653306606] [2021-11-23 02:13:03,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653306606] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:13:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215407495] [2021-11-23 02:13:03,113 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:13:03,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:13:03,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:13:03,113 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:13:03,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-23 02:13:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:13:03,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-23 02:13:03,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:13:03,526 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-23 02:13:03,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,644 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-23 02:13:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,716 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-23 02:13:03,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,800 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-23 02:13:03,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,896 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-23 02:13:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,001 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-23 02:13:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,124 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-23 02:13:04,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,275 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-23 02:13:04,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:13:04,612 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:13:04,613 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-23 02:13:14,748 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-23 02:13:14,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:13:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:13:39,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215407495] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:13:39,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2044835570] [2021-11-23 02:13:39,675 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-23 02:13:39,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:13:39,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:13:39,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211819265] [2021-11-23 02:13:39,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:13:39,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:13:39,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:13:39,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:13:39,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1301, Unknown=6, NotChecked=0, Total=1560 [2021-11-23 02:13:39,677 INFO L87 Difference]: Start difference. First operand 60922 states and 132787 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-23 02:13:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:13:58,370 INFO L93 Difference]: Finished difference Result 79154 states and 170820 transitions. [2021-11-23 02:13:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-23 02:13:58,370 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-23 02:13:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:13:58,571 INFO L225 Difference]: With dead ends: 79154 [2021-11-23 02:13:58,571 INFO L226 Difference]: Without dead ends: 79154 [2021-11-23 02:13:58,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1513 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=1081, Invalid=4019, Unknown=12, NotChecked=0, Total=5112 [2021-11-23 02:13:58,572 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 736 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 3952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1586 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:13:58,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 257 Invalid, 3952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 2211 Invalid, 0 Unknown, 1586 Unchecked, 1.8s Time] [2021-11-23 02:13:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79154 states. [2021-11-23 02:14:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79154 to 61485. [2021-11-23 02:14:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61485 states, 61472 states have (on average 2.1784389640812076) internal successors, (133913), 61484 states have internal predecessors, (133913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:14:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61485 states to 61485 states and 133913 transitions. [2021-11-23 02:14:00,803 INFO L78 Accepts]: Start accepts. Automaton has 61485 states and 133913 transitions. Word has length 45 [2021-11-23 02:14:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:14:00,803 INFO L470 AbstractCegarLoop]: Abstraction has 61485 states and 133913 transitions. [2021-11-23 02:14:00,803 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-23 02:14:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61485 states and 133913 transitions. [2021-11-23 02:14:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:14:00,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:14:00,806 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-23 02:14:00,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-23 02:14:01,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 02:14:01,014 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-23 02:14:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:14:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash -864126232, now seen corresponding path program 5 times [2021-11-23 02:14:01,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:14:01,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111483320] [2021-11-23 02:14:01,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:14:01,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:14:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:14:01,849 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-23 02:14:01,850 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:14:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111483320] [2021-11-23 02:14:01,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111483320] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:14:01,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081325172] [2021-11-23 02:14:01,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:14:01,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:14:01,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:14:01,853 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:14:01,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-23 02:14:01,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:14:01,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:14:01,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-23 02:14:01,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:14:02,336 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-23 02:14:02,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,684 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-23 02:14:02,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,758 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-23 02:14:02,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,819 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-23 02:14:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,894 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-23 02:14:02,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:02,980 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-23 02:14:03,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,089 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-23 02:14:03,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,208 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-23 02:14:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:14:03,474 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:14:03,474 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-23 02:14:13,621 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-23 02:14:13,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:14:34,646 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-23 02:14:34,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081325172] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:14:34,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [234030270] [2021-11-23 02:14:34,647 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-23 02:14:34,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:14:34,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:14:34,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436463827] [2021-11-23 02:14:34,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:14:34,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:14:34,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:14:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:14:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1300, Unknown=9, NotChecked=0, Total=1560 [2021-11-23 02:14:34,649 INFO L87 Difference]: Start difference. First operand 61485 states and 133913 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-23 02:15:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:15:06,532 INFO L93 Difference]: Finished difference Result 86011 states and 185381 transitions. [2021-11-23 02:15:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-23 02:15:06,533 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-23 02:15:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:15:06,719 INFO L225 Difference]: With dead ends: 86011 [2021-11-23 02:15:06,719 INFO L226 Difference]: Without dead ends: 86011 [2021-11-23 02:15:06,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 74 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=1183, Invalid=4499, Unknown=18, NotChecked=0, Total=5700 [2021-11-23 02:15:06,721 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 851 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2691 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:15:06,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 406 Invalid, 6380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 3497 Invalid, 0 Unknown, 2691 Unchecked, 2.6s Time] [2021-11-23 02:15:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86011 states. [2021-11-23 02:15:08,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86011 to 63335. [2021-11-23 02:15:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63335 states, 63322 states have (on average 2.174252234610404) internal successors, (137678), 63334 states have internal predecessors, (137678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:15:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63335 states to 63335 states and 137678 transitions. [2021-11-23 02:15:08,812 INFO L78 Accepts]: Start accepts. Automaton has 63335 states and 137678 transitions. Word has length 45 [2021-11-23 02:15:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:15:08,812 INFO L470 AbstractCegarLoop]: Abstraction has 63335 states and 137678 transitions. [2021-11-23 02:15:08,812 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-23 02:15:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 63335 states and 137678 transitions. [2021-11-23 02:15:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:15:08,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:15:08,828 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-23 02:15:08,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-23 02:15:09,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 02:15:09,049 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-23 02:15:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:15:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash 348768374, now seen corresponding path program 6 times [2021-11-23 02:15:09,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:15:09,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150524720] [2021-11-23 02:15:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:15:09,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:15:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:15:09,693 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-23 02:15:09,693 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:15:09,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150524720] [2021-11-23 02:15:09,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150524720] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:15:09,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028734011] [2021-11-23 02:15:09,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:15:09,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:15:09,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:15:09,694 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:15:09,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-23 02:15:09,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:15:09,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:15:09,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-23 02:15:09,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:15:10,237 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-23 02:15:10,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,330 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-23 02:15:10,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,384 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-23 02:15:10,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,446 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-23 02:15:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,526 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-23 02:15:10,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,609 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-23 02:15:10,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,701 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-23 02:15:10,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:10,813 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-23 02:15:11,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:11,202 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:15:11,202 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-23 02:15:19,321 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-23 02:15:19,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:15:25,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (let ((.cse4 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse10 0)))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |c_~#cache~0.base| (store (store (store (select .cse7 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse14 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse13 |c_~#cache~0.base| (store (select .cse13 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-23 02:15:26,422 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-23 02:15:26,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028734011] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:15:26,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1265424378] [2021-11-23 02:15:26,423 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-23 02:15:26,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:15:26,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:15:26,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940320758] [2021-11-23 02:15:26,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:15:26,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:15:26,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:15:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:15:26,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1242, Unknown=4, NotChecked=74, Total=1560 [2021-11-23 02:15:26,425 INFO L87 Difference]: Start difference. First operand 63335 states and 137678 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-23 02:15:28,815 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (let ((.cse4 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0))))) (store .cse3 |c_~#cache~0.base| (store (store (store (select .cse3 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse10 0)))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse7 |c_~#cache~0.base| (store (store (store (select .cse7 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse14 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse13 |c_~#cache~0.base| (store (select .cse13 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |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-23 02:15:40,372 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse11 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse15 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse12 |c_~#cache~0.base| (store (store (store (select .cse12 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:15:43,992 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse11 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse15 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse12 |c_~#cache~0.base| (store (store (store (select .cse12 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:15:45,862 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse11 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse15 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 1) 0))))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse12 |c_~#cache~0.base| (store (store (store (select .cse12 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse15)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:15:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:15:46,676 INFO L93 Difference]: Finished difference Result 86049 states and 185435 transitions. [2021-11-23 02:15:46,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-23 02:15:46,677 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-23 02:15:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:15:47,006 INFO L225 Difference]: With dead ends: 86049 [2021-11-23 02:15:47,006 INFO L226 Difference]: Without dead ends: 86049 [2021-11-23 02:15:47,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 13 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 32.8s TimeCoverageRelationStatistics Valid=952, Invalid=4908, Unknown=12, NotChecked=770, Total=6642 [2021-11-23 02:15:47,007 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 624 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2174 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:15:47,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 725 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2698 Invalid, 0 Unknown, 2174 Unchecked, 2.0s Time] [2021-11-23 02:15:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86049 states. [2021-11-23 02:15:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86049 to 63997. [2021-11-23 02:15:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63997 states, 63984 states have (on average 2.173246436609152) internal successors, (139053), 63996 states have internal predecessors, (139053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:15:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63997 states to 63997 states and 139053 transitions. [2021-11-23 02:15:48,900 INFO L78 Accepts]: Start accepts. Automaton has 63997 states and 139053 transitions. Word has length 45 [2021-11-23 02:15:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:15:48,903 INFO L470 AbstractCegarLoop]: Abstraction has 63997 states and 139053 transitions. [2021-11-23 02:15:48,903 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-23 02:15:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 63997 states and 139053 transitions. [2021-11-23 02:15:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:15:48,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:15:48,907 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-23 02:15:48,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-23 02:15:49,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:15:49,125 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:15:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:15:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash -437678920, now seen corresponding path program 7 times [2021-11-23 02:15:49,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:15:49,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934476372] [2021-11-23 02:15:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:15:49,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:15:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:15:49,853 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-23 02:15:49,854 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:15:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934476372] [2021-11-23 02:15:49,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934476372] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:15:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099516539] [2021-11-23 02:15:49,854 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:15:49,854 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:15:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:15:49,855 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:15:49,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-23 02:15:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:15:49,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-23 02:15:49,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:15:50,218 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-23 02:15:50,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,315 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-23 02:15:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,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-23 02:15:50,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,461 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-23 02:15:50,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,576 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-23 02:15:50,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,690 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-23 02:15:50,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,793 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-23 02:15:50,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:50,912 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-23 02:15:51,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:15:51,330 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:15:51,330 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-23 02:15:59,447 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-23 02:15:59,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:06,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))))) is different from false [2021-11-23 02:16:07,174 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-23 02:16:07,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099516539] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:07,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621249854] [2021-11-23 02:16:07,175 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-23 02:16:07,176 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:07,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:16:07,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150611613] [2021-11-23 02:16:07,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:07,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:16:07,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:16:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1238, Unknown=4, NotChecked=74, Total=1560 [2021-11-23 02:16:07,178 INFO L87 Difference]: Start difference. First operand 63997 states and 139053 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-23 02:16:09,931 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))))) (= |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|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-23 02:16:22,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))))) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse15) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse15)) (= |c_~#cache~0.offset| 0) (< 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|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:16:25,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))))) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse15) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse15)) (= (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|))) is different from false [2021-11-23 02:16:27,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))))) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse15) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse15)) (< 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|))) is different from false [2021-11-23 02:16:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:27,966 INFO L93 Difference]: Finished difference Result 90374 states and 194503 transitions. [2021-11-23 02:16:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-23 02:16:27,966 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-23 02:16:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:28,291 INFO L225 Difference]: With dead ends: 90374 [2021-11-23 02:16:28,292 INFO L226 Difference]: Without dead ends: 90374 [2021-11-23 02:16:28,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=984, Invalid=5830, Unknown=12, NotChecked=830, Total=7656 [2021-11-23 02:16:28,293 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 615 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 3515 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 6184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2585 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:28,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 658 Invalid, 6184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3515 Invalid, 0 Unknown, 2585 Unchecked, 2.4s Time] [2021-11-23 02:16:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90374 states. [2021-11-23 02:16:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90374 to 64283. [2021-11-23 02:16:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64283 states, 64270 states have (on average 2.172942274778279) internal successors, (139655), 64282 states have internal predecessors, (139655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64283 states to 64283 states and 139655 transitions. [2021-11-23 02:16:29,775 INFO L78 Accepts]: Start accepts. Automaton has 64283 states and 139655 transitions. Word has length 45 [2021-11-23 02:16:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:29,776 INFO L470 AbstractCegarLoop]: Abstraction has 64283 states and 139655 transitions. [2021-11-23 02:16:29,776 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-23 02:16:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 64283 states and 139655 transitions. [2021-11-23 02:16:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:29,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:29,779 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-23 02:16:29,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:29,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-11-23 02:16:29,981 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1908971414, now seen corresponding path program 8 times [2021-11-23 02:16:29,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:29,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930609073] [2021-11-23 02:16:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:29,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:30,890 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-23 02:16:30,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930609073] [2021-11-23 02:16:30,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930609073] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221102990] [2021-11-23 02:16:30,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:16:30,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:30,892 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:30,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c50ae6e9-cc9d-483e-9a7d-d6a20df97799/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-23 02:16:30,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:16:30,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:16:30,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-23 02:16:30,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:31,259 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-23 02:16:31,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,350 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-23 02:16:31,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,401 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-23 02:16:31,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,457 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-23 02:16:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,535 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-23 02:16:31,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,620 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-23 02:16:31,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,734 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-23 02:16:31,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:31,884 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-23 02:16:32,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:32,240 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:16:32,240 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-23 02:16:40,383 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-23 02:16:40,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:47,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |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_192| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-23 02:16:47,658 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-23 02:16:47,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221102990] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:47,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [581541785] [2021-11-23 02:16:47,659 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-23 02:16:47,659 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:47,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-23 02:16:47,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532071429] [2021-11-23 02:16:47,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:47,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-23 02:16:47,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:47,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-23 02:16:47,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1165, Unknown=4, NotChecked=72, Total=1482 [2021-11-23 02:16:47,661 INFO L87 Difference]: Start difference. First operand 64283 states and 139655 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-23 02:16:50,260 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse4 |c_~#cache~0.base| (store (store (store (select .cse4 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (select (select (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse10 |c_~#cache~0.base| (store (select .cse10 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse8 |c_~#cache~0.base| (store (store (store (select .cse8 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |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_192| Int)) (= (let ((.cse13 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse14 |c_~#cache~0.base| (store (select .cse14 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse12 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse13 0))))) (store .cse11 |c_~#cache~0.base| (store (store (store (select .cse11 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse13)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |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-23 02:17:20,162 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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (let ((.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8 0)))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |c_~#cache~0.base| (store (store (store (select .cse5 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192| Int)) (= (select (select (let ((.cse9 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse9 |c_~#cache~0.base| (store (store (store (select .cse9 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |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_192| Int)) (= (let ((.cse14 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse12 (let ((.cse13 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0)))) (store .cse15 |c_~#cache~0.base| (store (select .cse15 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 1) 0))))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse14 0))))) (store .cse12 |c_~#cache~0.base| (store (store (store (select .cse12 |c_~#cache~0.base|) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_192|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse14)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false