./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:06:27,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:06:27,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:06:27,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:06:27,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:06:27,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:06:27,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:06:27,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:06:27,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:06:27,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:06:27,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:06:27,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:06:27,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:06:27,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:06:27,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:06:27,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:06:27,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:06:27,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:06:27,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:06:27,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:06:27,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:06:27,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:06:27,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:06:27,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:06:27,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:06:27,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:06:27,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:06:27,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:06:27,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:06:27,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:06:27,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:06:27,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:06:27,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:06:27,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:06:27,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:06:27,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:06:27,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:06:27,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:06:27,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:06:27,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:06:27,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:06:27,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-25 19:06:28,009 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:06:28,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:06:28,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:06:28,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:06:28,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:06:28,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:06:28,022 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:06:28,022 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:06:28,022 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:06:28,022 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:06:28,023 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:06:28,023 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:06:28,023 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:06:28,023 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:06:28,023 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:06:28,024 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:06:28,024 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:06:28,024 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:06:28,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:06:28,025 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:06:28,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:06:28,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:06:28,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:06:28,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:06:28,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:06:28,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:06:28,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:06:28,027 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-25 19:06:28,027 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:06:28,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:06:28,027 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:06:28,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:06:28,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:06:28,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:06:28,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:06:28,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:06:28,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:06:28,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:06:28,029 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:06:28,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:06:28,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:06:28,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:06:28,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:06:28,030 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_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/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_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2021-11-25 19:06:28,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:06:28,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:06:28,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:06:28,366 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:06:28,367 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:06:28,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-25 19:06:28,478 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/a65cd26cd/d8d1b7a5272a4de4850fe918be24dbdf/FLAGda14b7559 [2021-11-25 19:06:29,167 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:06:29,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-25 19:06:29,204 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/a65cd26cd/d8d1b7a5272a4de4850fe918be24dbdf/FLAGda14b7559 [2021-11-25 19:06:29,377 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/a65cd26cd/d8d1b7a5272a4de4850fe918be24dbdf [2021-11-25 19:06:29,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:06:29,393 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:06:29,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:06:29,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:06:29,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:06:29,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:06:29" (1/1) ... [2021-11-25 19:06:29,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aaddd9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:29, skipping insertion in model container [2021-11-25 19:06:29,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:06:29" (1/1) ... [2021-11-25 19:06:29,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:06:29,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:06:30,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:06:30,174 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:06:30,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:06:30,291 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:06:30,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30 WrapperNode [2021-11-25 19:06:30,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:06:30,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:06:30,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:06:30,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:06:30,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,405 INFO L137 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2021-11-25 19:06:30,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:06:30,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:06:30,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:06:30,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:06:30,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:06:30,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:06:30,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:06:30,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:06:30,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (1/1) ... [2021-11-25 19:06:30,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:06:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:30,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:06:30,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:06:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:06:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:06:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:06:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:06:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 19:06:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:06:30,589 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-25 19:06:30,589 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-25 19:06:30,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:06:30,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:06:30,592 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:06:30,794 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:06:30,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:06:31,131 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:06:31,142 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:06:31,142 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 19:06:31,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:06:31 BoogieIcfgContainer [2021-11-25 19:06:31,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:06:31,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:06:31,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:06:31,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:06:31,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:06:29" (1/3) ... [2021-11-25 19:06:31,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881251b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:06:31, skipping insertion in model container [2021-11-25 19:06:31,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:06:30" (2/3) ... [2021-11-25 19:06:31,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5881251b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:06:31, skipping insertion in model container [2021-11-25 19:06:31,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:06:31" (3/3) ... [2021-11-25 19:06:31,159 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2021-11-25 19:06:31,167 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:06:31,168 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:06:31,168 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-25 19:06:31,168 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:06:31,239 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,240 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,241 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,242 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,243 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,244 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,245 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,246 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-25 19:06:31,246 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-25 19:06:31,246 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,246 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-25 19:06:31,247 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-25 19:06:31,247 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-25 19:06:31,247 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-25 19:06:31,247 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-25 19:06:31,248 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-25 19:06:31,248 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-25 19:06:31,248 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-25 19:06:31,248 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-25 19:06:31,249 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-25 19:06:31,249 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-25 19:06:31,249 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-25 19:06:31,249 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-25 19:06:31,276 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-25 19:06:31,276 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-25 19:06:31,277 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-25 19:06:31,277 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-25 19:06:31,277 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-25 19:06:31,277 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-25 19:06:31,277 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-25 19:06:31,277 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-25 19:06:31,278 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-25 19:06:31,278 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-25 19:06:31,278 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-25 19:06:31,278 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-25 19:06:31,279 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-25 19:06:31,279 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-25 19:06:31,279 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-25 19:06:31,279 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-25 19:06:31,279 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-25 19:06:31,280 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-25 19:06:31,280 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-25 19:06:31,280 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-25 19:06:31,280 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-25 19:06:31,280 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-25 19:06:31,281 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-25 19:06:31,281 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-25 19:06:31,281 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-25 19:06:31,281 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-25 19:06:31,281 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-25 19:06:31,282 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-25 19:06:31,282 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-25 19:06:31,282 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-25 19:06:31,282 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-25 19:06:31,283 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-25 19:06:31,283 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-25 19:06:31,283 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-25 19:06:31,283 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-25 19:06:31,284 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-25 19:06:31,284 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-25 19:06:31,284 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-25 19:06:31,284 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-25 19:06:31,285 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-25 19:06:31,285 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-25 19:06:31,285 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-25 19:06:31,285 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-25 19:06:31,286 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-25 19:06:31,286 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-25 19:06:31,286 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-25 19:06:31,286 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-25 19:06:31,287 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-25 19:06:31,287 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-25 19:06:31,287 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-25 19:06:31,287 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-25 19:06:31,288 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-25 19:06:31,288 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-25 19:06:31,288 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-25 19:06:31,288 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-25 19:06:31,288 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-25 19:06:31,289 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-25 19:06:31,289 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-25 19:06:31,289 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-25 19:06:31,289 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-25 19:06:31,289 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-25 19:06:31,290 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-25 19:06:31,290 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-25 19:06:31,290 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-25 19:06:31,290 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-25 19:06:31,291 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-25 19:06:31,291 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-25 19:06:31,291 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-25 19:06:31,291 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-25 19:06:31,291 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-25 19:06:31,292 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-25 19:06:31,292 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-25 19:06:31,292 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-25 19:06:31,292 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-25 19:06:31,292 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-25 19:06:31,293 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-25 19:06:31,293 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-25 19:06:31,293 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-25 19:06:31,293 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-25 19:06:31,293 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-25 19:06:31,294 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-25 19:06:31,294 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-25 19:06:31,294 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-25 19:06:31,294 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-25 19:06:31,295 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-25 19:06:31,295 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-25 19:06:31,295 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-25 19:06:31,295 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-25 19:06:31,295 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-25 19:06:31,296 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-25 19:06:31,296 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-25 19:06:31,296 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-25 19:06:31,296 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-25 19:06:31,297 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-25 19:06:31,297 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-25 19:06:31,297 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-25 19:06:31,297 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-25 19:06:31,297 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-25 19:06:31,298 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-25 19:06:31,298 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-25 19:06:31,298 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-25 19:06:31,298 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-25 19:06:31,299 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-25 19:06:31,299 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-25 19:06:31,299 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-25 19:06:31,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,299 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,300 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,301 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,310 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,311 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,311 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-25 19:06:31,311 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-25 19:06:31,312 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-25 19:06:31,312 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-25 19:06:31,312 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-25 19:06:31,312 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-25 19:06:31,312 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-25 19:06:31,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,313 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:06:31,313 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-25 19:06:31,316 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-25 19:06:31,379 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:06:31,387 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-25 19:06:31,388 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-25 19:06:31,405 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:06:31,424 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 106 transitions, 217 flow [2021-11-25 19:06:31,427 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 106 transitions, 217 flow [2021-11-25 19:06:31,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 106 transitions, 217 flow [2021-11-25 19:06:31,491 INFO L129 PetriNetUnfolder]: 6/105 cut-off events. [2021-11-25 19:06:31,492 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-25 19:06:31,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 6/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 136 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2021-11-25 19:06:31,504 INFO L116 LiptonReduction]: Number of co-enabled transitions 3192 [2021-11-25 19:06:33,969 INFO L131 LiptonReduction]: Checked pairs total: 8972 [2021-11-25 19:06:33,969 INFO L133 LiptonReduction]: Total number of compositions: 68 [2021-11-25 19:06:33,980 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2021-11-25 19:06:34,034 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 19:06:34,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:34,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:34,051 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1578252910, now seen corresponding path program 1 times [2021-11-25 19:06:34,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:34,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324527591] [2021-11-25 19:06:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:34,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:34,319 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-25 19:06:34,319 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:34,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324527591] [2021-11-25 19:06:34,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324527591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:34,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:34,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:06:34,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681437854] [2021-11-25 19:06:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:34,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:06:34,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:06:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:06:34,373 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:34,486 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2021-11-25 19:06:34,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:06:34,490 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-25 19:06:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:34,524 INFO L225 Difference]: With dead ends: 327 [2021-11-25 19:06:34,524 INFO L226 Difference]: Without dead ends: 327 [2021-11-25 19:06:34,526 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-25 19:06:34,536 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:34,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:06:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-25 19:06:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-11-25 19:06:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2021-11-25 19:06:34,631 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2021-11-25 19:06:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:34,632 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2021-11-25 19:06:34,632 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-25 19:06:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2021-11-25 19:06:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 19:06:34,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:34,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:34,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:06:34,639 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1431754540, now seen corresponding path program 1 times [2021-11-25 19:06:34,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:34,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969286855] [2021-11-25 19:06:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:34,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:34,732 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-25 19:06:34,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969286855] [2021-11-25 19:06:34,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969286855] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449466203] [2021-11-25 19:06:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:34,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:34,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:34,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:06:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:34,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:06:34,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:34,968 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-25 19:06:34,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:35,043 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-25 19:06:35,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449466203] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:06:35,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1426145732] [2021-11-25 19:06:35,053 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-25 19:06:35,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:06:35,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-11-25 19:06:35,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487643337] [2021-11-25 19:06:35,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:06:35,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:35,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:35,078 INFO L87 Difference]: Start difference. First operand 327 states and 651 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:35,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:35,144 INFO L93 Difference]: Finished difference Result 330 states and 654 transitions. [2021-11-25 19:06:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-25 19:06:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:35,148 INFO L225 Difference]: With dead ends: 330 [2021-11-25 19:06:35,149 INFO L226 Difference]: Without dead ends: 330 [2021-11-25 19:06:35,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:35,156 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:35,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:06:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-25 19:06:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-25 19:06:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 322 states have (on average 2.031055900621118) internal successors, (654), 329 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 654 transitions. [2021-11-25 19:06:35,204 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 654 transitions. Word has length 12 [2021-11-25 19:06:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:35,204 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 654 transitions. [2021-11-25 19:06:35,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 654 transitions. [2021-11-25 19:06:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 19:06:35,237 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:35,237 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:35,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:35,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:35,439 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1488091630, now seen corresponding path program 2 times [2021-11-25 19:06:35,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128043988] [2021-11-25 19:06:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:35,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:35,613 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-25 19:06:35,613 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128043988] [2021-11-25 19:06:35,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128043988] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:35,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128360532] [2021-11-25 19:06:35,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:06:35,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:35,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:35,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:35,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:06:35,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:06:35,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:35,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 19:06:35,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:35,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:06:35,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:35,858 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-25 19:06:35,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:35,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:35,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:35,926 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:35,927 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-25 19:06:36,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:36,038 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:36,039 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-25 19:06:36,080 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-25 19:06:36,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:06:36,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128360532] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:36,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:06:36,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2021-11-25 19:06:36,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139067574] [2021-11-25 19:06:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:36,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 19:06:36,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 19:06:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:06:36,085 INFO L87 Difference]: Start difference. First operand 330 states and 654 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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-25 19:06:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:36,762 INFO L93 Difference]: Finished difference Result 754 states and 1502 transitions. [2021-11-25 19:06:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:06:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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-25 19:06:36,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:36,773 INFO L225 Difference]: With dead ends: 754 [2021-11-25 19:06:36,773 INFO L226 Difference]: Without dead ends: 754 [2021-11-25 19:06:36,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-11-25 19:06:36,782 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 182 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:36,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 80 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-25 19:06:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-11-25 19:06:36,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 456. [2021-11-25 19:06:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 448 states have (on average 2.0223214285714284) internal successors, (906), 455 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 906 transitions. [2021-11-25 19:06:36,814 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 906 transitions. Word has length 15 [2021-11-25 19:06:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:36,814 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 906 transitions. [2021-11-25 19:06:36,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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-25 19:06:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 906 transitions. [2021-11-25 19:06:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 19:06:36,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:36,816 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:36,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:37,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:37,038 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:37,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1042957047, now seen corresponding path program 1 times [2021-11-25 19:06:37,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:37,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84581114] [2021-11-25 19:06:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:37,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:37,181 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-25 19:06:37,182 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:37,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84581114] [2021-11-25 19:06:37,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84581114] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773357131] [2021-11-25 19:06:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:37,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:37,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:37,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:06:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:37,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:06:37,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:37,399 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-25 19:06:37,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:37,530 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-25 19:06:37,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773357131] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:06:37,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1683936558] [2021-11-25 19:06:37,532 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-25 19:06:37,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:06:37,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-25 19:06:37,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26303063] [2021-11-25 19:06:37,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:06:37,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:06:37,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:37,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:06:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:06:37,538 INFO L87 Difference]: Start difference. First operand 456 states and 906 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:37,625 INFO L93 Difference]: Finished difference Result 462 states and 912 transitions. [2021-11-25 19:06:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:06:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 19:06:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:37,632 INFO L225 Difference]: With dead ends: 462 [2021-11-25 19:06:37,632 INFO L226 Difference]: Without dead ends: 462 [2021-11-25 19:06:37,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:06:37,635 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:37,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:06:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-25 19:06:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2021-11-25 19:06:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 454 states have (on average 2.0088105726872247) internal successors, (912), 461 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 912 transitions. [2021-11-25 19:06:37,701 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 912 transitions. Word has length 15 [2021-11-25 19:06:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:37,701 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 912 transitions. [2021-11-25 19:06:37,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 912 transitions. [2021-11-25 19:06:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 19:06:37,708 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:37,709 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:37,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:37,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:37,923 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash -564794441, now seen corresponding path program 2 times [2021-11-25 19:06:37,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:37,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827202224] [2021-11-25 19:06:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:37,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:38,174 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-25 19:06:38,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:38,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827202224] [2021-11-25 19:06:38,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827202224] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:38,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:38,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:06:38,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694911061] [2021-11-25 19:06:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:38,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:38,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:38,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:38,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:38,179 INFO L87 Difference]: Start difference. First operand 462 states and 912 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-25 19:06:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:38,559 INFO L93 Difference]: Finished difference Result 556 states and 1100 transitions. [2021-11-25 19:06:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:38,560 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-25 19:06:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:38,565 INFO L225 Difference]: With dead ends: 556 [2021-11-25 19:06:38,565 INFO L226 Difference]: Without dead ends: 556 [2021-11-25 19:06:38,565 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-25 19:06:38,566 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:38,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 19:06:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-11-25 19:06:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 522. [2021-11-25 19:06:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 514 states have (on average 2.007782101167315) internal successors, (1032), 521 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1032 transitions. [2021-11-25 19:06:38,595 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1032 transitions. Word has length 21 [2021-11-25 19:06:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:38,600 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 1032 transitions. [2021-11-25 19:06:38,601 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-25 19:06:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1032 transitions. [2021-11-25 19:06:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:06:38,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:38,606 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-25 19:06:38,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:06:38,607 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash 116571226, now seen corresponding path program 1 times [2021-11-25 19:06:38,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:38,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42145301] [2021-11-25 19:06:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:38,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:38,760 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-25 19:06:38,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:38,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42145301] [2021-11-25 19:06:38,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42145301] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:38,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:38,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:06:38,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721352686] [2021-11-25 19:06:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:38,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:38,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:38,762 INFO L87 Difference]: Start difference. First operand 522 states and 1032 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-25 19:06:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:39,227 INFO L93 Difference]: Finished difference Result 588 states and 1164 transitions. [2021-11-25 19:06:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:39,228 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-25 19:06:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:39,233 INFO L225 Difference]: With dead ends: 588 [2021-11-25 19:06:39,233 INFO L226 Difference]: Without dead ends: 588 [2021-11-25 19:06:39,234 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-25 19:06:39,234 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:39,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 19:06:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2021-11-25 19:06:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2021-11-25 19:06:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 580 states have (on average 2.0068965517241377) internal successors, (1164), 587 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1164 transitions. [2021-11-25 19:06:39,259 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1164 transitions. Word has length 27 [2021-11-25 19:06:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:39,259 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 1164 transitions. [2021-11-25 19:06:39,260 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-25 19:06:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1164 transitions. [2021-11-25 19:06:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:06:39,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:39,261 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-25 19:06:39,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:06:39,262 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 566778797, now seen corresponding path program 1 times [2021-11-25 19:06:39,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:39,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544337539] [2021-11-25 19:06:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:39,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:39,386 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-25 19:06:39,386 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544337539] [2021-11-25 19:06:39,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544337539] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:39,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:39,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:06:39,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384614523] [2021-11-25 19:06:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:39,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:39,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:39,389 INFO L87 Difference]: Start difference. First operand 588 states and 1164 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-25 19:06:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:39,717 INFO L93 Difference]: Finished difference Result 675 states and 1338 transitions. [2021-11-25 19:06:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:39,718 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-25 19:06:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:39,724 INFO L225 Difference]: With dead ends: 675 [2021-11-25 19:06:39,724 INFO L226 Difference]: Without dead ends: 659 [2021-11-25 19:06:39,724 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-25 19:06:39,725 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:39,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:06:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-11-25 19:06:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 636. [2021-11-25 19:06:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 628 states have (on average 2.0031847133757963) internal successors, (1258), 635 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1258 transitions. [2021-11-25 19:06:39,777 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1258 transitions. Word has length 27 [2021-11-25 19:06:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:39,778 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 1258 transitions. [2021-11-25 19:06:39,778 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-25 19:06:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1258 transitions. [2021-11-25 19:06:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:06:39,780 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:39,780 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-25 19:06:39,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 19:06:39,780 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1553633119, now seen corresponding path program 1 times [2021-11-25 19:06:39,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:39,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084768383] [2021-11-25 19:06:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:39,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:40,038 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-25 19:06:40,038 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:40,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084768383] [2021-11-25 19:06:40,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084768383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:40,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:40,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:06:40,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395104326] [2021-11-25 19:06:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:40,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:40,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:40,041 INFO L87 Difference]: Start difference. First operand 636 states and 1258 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-25 19:06:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:40,293 INFO L93 Difference]: Finished difference Result 1390 states and 2753 transitions. [2021-11-25 19:06:40,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:40,294 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-25 19:06:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:40,307 INFO L225 Difference]: With dead ends: 1390 [2021-11-25 19:06:40,307 INFO L226 Difference]: Without dead ends: 1390 [2021-11-25 19:06:40,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:06:40,308 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 116 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:40,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 92 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:06:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2021-11-25 19:06:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 656. [2021-11-25 19:06:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 648 states have (on average 1.9830246913580247) internal successors, (1285), 655 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1285 transitions. [2021-11-25 19:06:40,345 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1285 transitions. Word has length 31 [2021-11-25 19:06:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:40,346 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 1285 transitions. [2021-11-25 19:06:40,346 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-25 19:06:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1285 transitions. [2021-11-25 19:06:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:06:40,348 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:40,348 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:40,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 19:06:40,349 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash 992145763, now seen corresponding path program 1 times [2021-11-25 19:06:40,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911210763] [2021-11-25 19:06:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:40,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:40,483 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-25 19:06:40,483 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:40,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911210763] [2021-11-25 19:06:40,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911210763] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:40,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845448316] [2021-11-25 19:06:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:40,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:40,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:40,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:40,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:06:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:40,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-25 19:06:40,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:40,767 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-25 19:06:40,826 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-25 19:06:40,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:06:40,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845448316] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:40,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:06:40,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-25 19:06:40,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056211963] [2021-11-25 19:06:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:40,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:40,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 19:06:40,829 INFO L87 Difference]: Start difference. First operand 656 states and 1285 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-25 19:06:40,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:40,962 INFO L93 Difference]: Finished difference Result 1038 states and 2023 transitions. [2021-11-25 19:06:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:40,963 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-25 19:06:40,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:40,972 INFO L225 Difference]: With dead ends: 1038 [2021-11-25 19:06:40,973 INFO L226 Difference]: Without dead ends: 1038 [2021-11-25 19:06:40,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:06:40,975 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 132 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:40,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 120 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:06:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-11-25 19:06:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 670. [2021-11-25 19:06:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 662 states have (on average 1.9637462235649548) internal successors, (1300), 669 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1300 transitions. [2021-11-25 19:06:41,008 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1300 transitions. Word has length 31 [2021-11-25 19:06:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:41,008 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1300 transitions. [2021-11-25 19:06:41,008 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-25 19:06:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1300 transitions. [2021-11-25 19:06:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:06:41,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:41,010 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-25 19:06:41,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:41,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:41,230 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1099506277, now seen corresponding path program 2 times [2021-11-25 19:06:41,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:41,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263886401] [2021-11-25 19:06:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:41,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:41,450 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-25 19:06:41,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:41,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263886401] [2021-11-25 19:06:41,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263886401] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:41,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023185989] [2021-11-25 19:06:41,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:06:41,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:41,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:41,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:06:41,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:06:41,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:41,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-25 19:06:41,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:41,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 19:06:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-25 19:06:41,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:06:41,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023185989] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:41,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:06:41,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-25 19:06:41,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65620961] [2021-11-25 19:06:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:41,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:41,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-11-25 19:06:41,760 INFO L87 Difference]: Start difference. First operand 670 states and 1300 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-25 19:06:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:41,924 INFO L93 Difference]: Finished difference Result 1591 states and 3127 transitions. [2021-11-25 19:06:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:41,925 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-25 19:06:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:41,939 INFO L225 Difference]: With dead ends: 1591 [2021-11-25 19:06:41,939 INFO L226 Difference]: Without dead ends: 1591 [2021-11-25 19:06:41,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:06:41,940 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:41,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 138 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:06:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2021-11-25 19:06:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 706. [2021-11-25 19:06:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 698 states have (on average 1.9656160458452723) internal successors, (1372), 705 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1372 transitions. [2021-11-25 19:06:41,979 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1372 transitions. Word has length 31 [2021-11-25 19:06:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:41,979 INFO L470 AbstractCegarLoop]: Abstraction has 706 states and 1372 transitions. [2021-11-25 19:06:41,980 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-25 19:06:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1372 transitions. [2021-11-25 19:06:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 19:06:41,981 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:41,981 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-25 19:06:42,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:42,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:06:42,206 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 180552155, now seen corresponding path program 3 times [2021-11-25 19:06:42,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:42,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379086296] [2021-11-25 19:06:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:42,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:42,344 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-25 19:06:42,345 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:42,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379086296] [2021-11-25 19:06:42,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379086296] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:42,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577645581] [2021-11-25 19:06:42,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:06:42,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:42,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:42,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:42,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 19:06:42,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:06:42,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:42,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-25 19:06:42,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:42,615 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-25 19:06:42,673 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-25 19:06:42,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:06:42,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577645581] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:42,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:06:42,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-25 19:06:42,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690922974] [2021-11-25 19:06:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:42,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:42,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:42,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:42,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-25 19:06:42,676 INFO L87 Difference]: Start difference. First operand 706 states and 1372 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-25 19:06:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:42,847 INFO L93 Difference]: Finished difference Result 1516 states and 2951 transitions. [2021-11-25 19:06:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:06:42,848 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-25 19:06:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:42,861 INFO L225 Difference]: With dead ends: 1516 [2021-11-25 19:06:42,861 INFO L226 Difference]: Without dead ends: 1516 [2021-11-25 19:06:42,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:06:42,862 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 152 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:42,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 144 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:06:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-11-25 19:06:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 699. [2021-11-25 19:06:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 691 states have (on average 1.9652677279305355) internal successors, (1358), 698 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1358 transitions. [2021-11-25 19:06:42,899 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1358 transitions. Word has length 31 [2021-11-25 19:06:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:42,900 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 1358 transitions. [2021-11-25 19:06:42,900 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-25 19:06:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1358 transitions. [2021-11-25 19:06:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-25 19:06:42,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:42,901 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] [2021-11-25 19:06:42,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:43,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-25 19:06:43,114 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash -724410956, now seen corresponding path program 1 times [2021-11-25 19:06:43,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:43,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957764119] [2021-11-25 19:06:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:43,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:06:43,271 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:43,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957764119] [2021-11-25 19:06:43,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957764119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:06:43,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:06:43,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:06:43,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593991473] [2021-11-25 19:06:43,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:06:43,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:06:43,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:06:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:06:43,275 INFO L87 Difference]: Start difference. First operand 699 states and 1358 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:43,548 INFO L93 Difference]: Finished difference Result 793 states and 1546 transitions. [2021-11-25 19:06:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:06:43,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-25 19:06:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:43,556 INFO L225 Difference]: With dead ends: 793 [2021-11-25 19:06:43,556 INFO L226 Difference]: Without dead ends: 769 [2021-11-25 19:06:43,556 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-25 19:06:43,558 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:43,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 16 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:06:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2021-11-25 19:06:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 617. [2021-11-25 19:06:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 610 states have (on average 1.9540983606557376) internal successors, (1192), 616 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1192 transitions. [2021-11-25 19:06:43,593 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1192 transitions. Word has length 35 [2021-11-25 19:06:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:43,594 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 1192 transitions. [2021-11-25 19:06:43,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1192 transitions. [2021-11-25 19:06:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:06:43,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:43,596 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-25 19:06:43,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 19:06:43,597 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:06:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1618809597, now seen corresponding path program 1 times [2021-11-25 19:06:43,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266736168] [2021-11-25 19:06:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:43,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:44,065 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-25 19:06:44,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:44,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266736168] [2021-11-25 19:06:44,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266736168] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:44,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475955292] [2021-11-25 19:06:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:44,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:44,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:44,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:44,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 19:06:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:44,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:06:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:44,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:06:44,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,653 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-25 19:06:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,739 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-25 19:06:44,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,842 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-25 19:06:45,312 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-25 19:06:45,312 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 53 treesize of output 61 [2021-11-25 19:06:45,366 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-25 19:06:45,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:52,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_60| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_60|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (and (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_832 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_832 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_60|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|))))) is different from false [2021-11-25 19:07:15,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_60| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_60|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_60|) (and (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse6 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6))))))) is different from false [2021-11-25 19:07:17,838 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-25 19:07:17,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475955292] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:17,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [53214257] [2021-11-25 19:07:17,840 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-25 19:07:17,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:17,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-25 19:07:17,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616367037] [2021-11-25 19:07:17,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:17,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:07:17,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:17,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:07:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=641, Unknown=12, NotChecked=110, Total=930 [2021-11-25 19:07:17,844 INFO L87 Difference]: Start difference. First operand 617 states and 1192 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:20,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_60| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_60|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| Int)) (or (and (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_832 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_832 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)))) (forall ((v_ArrVal_832 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330| v_ArrVal_832)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_60|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_330|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:07:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:21,657 INFO L93 Difference]: Finished difference Result 2231 states and 4418 transitions. [2021-11-25 19:07:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:07:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:07:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:21,677 INFO L225 Difference]: With dead ends: 2231 [2021-11-25 19:07:21,677 INFO L226 Difference]: Without dead ends: 2230 [2021-11-25 19:07:21,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=304, Invalid=1027, Unknown=13, NotChecked=216, Total=1560 [2021-11-25 19:07:21,679 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 371 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 723 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:21,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 238 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1043 Invalid, 0 Unknown, 723 Unchecked, 1.3s Time] [2021-11-25 19:07:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2021-11-25 19:07:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 630. [2021-11-25 19:07:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 623 states have (on average 1.9550561797752808) internal successors, (1218), 629 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1218 transitions. [2021-11-25 19:07:21,721 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1218 transitions. Word has length 45 [2021-11-25 19:07:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:21,722 INFO L470 AbstractCegarLoop]: Abstraction has 630 states and 1218 transitions. [2021-11-25 19:07:21,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1218 transitions. [2021-11-25 19:07:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:07:21,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:21,724 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-25 19:07:21,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:21,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:21,946 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:07:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1234870293, now seen corresponding path program 2 times [2021-11-25 19:07:21,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:21,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866828995] [2021-11-25 19:07:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:21,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:22,516 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-25 19:07:22,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:22,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866828995] [2021-11-25 19:07:22,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866828995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:22,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75502468] [2021-11-25 19:07:22,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:22,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:22,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:22,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:07:22,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:07:22,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:22,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:07:22,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:22,806 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-25 19:07:22,999 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-25 19:07:23,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,084 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-25 19:07:23,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,180 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-25 19:07:23,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,386 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-25 19:07:23,506 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:07:23,506 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-25 19:07:23,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:23,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2021-11-25 19:07:23,729 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-25 19:07:23,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:24,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:24,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:07:25,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:07:25,534 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-25 19:07:25,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75502468] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:25,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:07:25,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-25 19:07:25,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741746008] [2021-11-25 19:07:25,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:07:25,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:07:25,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:25,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:07:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:07:25,537 INFO L87 Difference]: Start difference. First operand 630 states and 1218 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:26,030 INFO L93 Difference]: Finished difference Result 940 states and 1828 transitions. [2021-11-25 19:07:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:07:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:07:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:26,046 INFO L225 Difference]: With dead ends: 940 [2021-11-25 19:07:26,047 INFO L226 Difference]: Without dead ends: 940 [2021-11-25 19:07:26,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:07:26,048 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:26,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 341 Unchecked, 0.2s Time] [2021-11-25 19:07:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2021-11-25 19:07:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 635. [2021-11-25 19:07:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 628 states have (on average 1.9554140127388535) internal successors, (1228), 634 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1228 transitions. [2021-11-25 19:07:26,076 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1228 transitions. Word has length 45 [2021-11-25 19:07:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:26,076 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 1228 transitions. [2021-11-25 19:07:26,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1228 transitions. [2021-11-25 19:07:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:07:26,078 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:26,078 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:07:26,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:26,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 19:07:26,292 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:07:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1337988693, now seen corresponding path program 3 times [2021-11-25 19:07:26,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430458884] [2021-11-25 19:07:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:26,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:26,665 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-25 19:07:26,665 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430458884] [2021-11-25 19:07:26,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430458884] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098888316] [2021-11-25 19:07:26,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:07:26,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:26,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:26,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:26,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 19:07:26,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:07:26,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:26,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:07:26,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:27,352 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-25 19:07:27,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:27,403 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-25 19:07:27,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:27,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:27,494 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-25 19:07:27,830 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-25 19:07:27,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 49 [2021-11-25 19:07:27,933 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:07:27,934 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-25 19:07:27,996 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-25 19:07:27,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:33,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (and (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_1136 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|))) is different from false [2021-11-25 19:07:38,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (and (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) is different from false [2021-11-25 19:07:40,393 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-25 19:07:40,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098888316] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729884676] [2021-11-25 19:07:40,395 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-25 19:07:40,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:40,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-25 19:07:40,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034370179] [2021-11-25 19:07:40,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:40,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 19:07:40,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:40,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 19:07:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=618, Unknown=5, NotChecked=106, Total=870 [2021-11-25 19:07:40,399 INFO L87 Difference]: Start difference. First operand 635 states and 1228 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:41,938 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (and (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-25 19:07:44,001 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_62| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (and (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_1136 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_62|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_62|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:07:45,744 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332|) (and (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_1136 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_1136 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_332| v_ArrVal_1136)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:07:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:46,492 INFO L93 Difference]: Finished difference Result 2325 states and 4599 transitions. [2021-11-25 19:07:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-25 19:07:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:07:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:46,511 INFO L225 Difference]: With dead ends: 2325 [2021-11-25 19:07:46,512 INFO L226 Difference]: Without dead ends: 2323 [2021-11-25 19:07:46,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=249, Invalid=1095, Unknown=8, NotChecked=370, Total=1722 [2021-11-25 19:07:46,517 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 440 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 760 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:46,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 228 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 877 Invalid, 0 Unknown, 760 Unchecked, 1.0s Time] [2021-11-25 19:07:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2021-11-25 19:07:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 654. [2021-11-25 19:07:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 647 states have (on average 1.9582689335394128) internal successors, (1267), 653 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1267 transitions. [2021-11-25 19:07:46,560 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1267 transitions. Word has length 45 [2021-11-25 19:07:46,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:46,561 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 1267 transitions. [2021-11-25 19:07:46,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1267 transitions. [2021-11-25 19:07:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:07:46,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:46,563 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-25 19:07:46,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:46,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 19:07:46,778 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:07:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1335861783, now seen corresponding path program 4 times [2021-11-25 19:07:46,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:46,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084488682] [2021-11-25 19:07:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:46,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:47,225 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-25 19:07:47,225 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084488682] [2021-11-25 19:07:47,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084488682] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:47,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440587863] [2021-11-25 19:07:47,226 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:07:47,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:47,227 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:47,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 19:07:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:47,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:07:47,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:47,722 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-25 19:07:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:47,790 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-25 19:07:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:47,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:47,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:47,877 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-25 19:07:48,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:07:48,183 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-25 19:07:48,380 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-25 19:07:48,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2021-11-25 19:07:48,442 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-25 19:07:48,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:05,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_63| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_63|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (and (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_63|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|))))) is different from false [2021-11-25 19:08:24,427 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-25 19:08:24,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440587863] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:24,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [826820389] [2021-11-25 19:08:24,428 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-25 19:08:24,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:24,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-25 19:08:24,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40903043] [2021-11-25 19:08:24,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:24,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:08:24,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:08:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=710, Unknown=14, NotChecked=56, Total=930 [2021-11-25 19:08:24,432 INFO L87 Difference]: Start difference. First operand 654 states and 1267 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:26,920 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_63| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_63|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| Int)) (or (and (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((v_ArrVal_1290 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333| v_ArrVal_1290))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_63|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_333|))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:08:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:27,848 INFO L93 Difference]: Finished difference Result 2376 states and 4718 transitions. [2021-11-25 19:08:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:08:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:08:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:27,868 INFO L225 Difference]: With dead ends: 2376 [2021-11-25 19:08:27,869 INFO L226 Difference]: Without dead ends: 2376 [2021-11-25 19:08:27,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=286, Invalid=1113, Unknown=15, NotChecked=146, Total=1560 [2021-11-25 19:08:27,871 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 323 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:27,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 249 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 588 Invalid, 0 Unknown, 772 Unchecked, 0.9s Time] [2021-11-25 19:08:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2021-11-25 19:08:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 654. [2021-11-25 19:08:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 647 states have (on average 1.9582689335394128) internal successors, (1267), 653 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1267 transitions. [2021-11-25 19:08:27,953 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1267 transitions. Word has length 45 [2021-11-25 19:08:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:27,954 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 1267 transitions. [2021-11-25 19:08:27,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1267 transitions. [2021-11-25 19:08:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:08:27,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:27,956 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-25 19:08:27,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:28,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 19:08:28,170 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:08:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2078878673, now seen corresponding path program 5 times [2021-11-25 19:08:28,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:28,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812082019] [2021-11-25 19:08:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:28,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:28,709 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-25 19:08:28,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:28,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812082019] [2021-11-25 19:08:28,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812082019] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:28,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965127813] [2021-11-25 19:08:28,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:08:28,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:28,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:28,712 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:28,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 19:08:28,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:08:28,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:28,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:08:28,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:28,991 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-25 19:08:29,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:08:29,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,237 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-25 19:08:29,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,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 30 treesize of output 32 [2021-11-25 19:08:29,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,519 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-25 19:08:29,645 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:08:29,646 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-25 19:08:29,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:29,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2021-11-25 19:08:29,869 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-25 19:08:29,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:31,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:08:31,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:08:31,661 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-25 19:08:31,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965127813] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:31,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:08:31,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-25 19:08:31,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358471188] [2021-11-25 19:08:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:08:31,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:08:31,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:08:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:08:31,664 INFO L87 Difference]: Start difference. First operand 654 states and 1267 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:32,055 INFO L93 Difference]: Finished difference Result 925 states and 1800 transitions. [2021-11-25 19:08:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:08:32,062 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:08:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:32,068 INFO L225 Difference]: With dead ends: 925 [2021-11-25 19:08:32,069 INFO L226 Difference]: Without dead ends: 925 [2021-11-25 19:08:32,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:08:32,070 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:32,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 325 Unchecked, 0.2s Time] [2021-11-25 19:08:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-11-25 19:08:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 656. [2021-11-25 19:08:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 649 states have (on average 1.958397534668721) internal successors, (1271), 655 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1271 transitions. [2021-11-25 19:08:32,096 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1271 transitions. Word has length 45 [2021-11-25 19:08:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:32,096 INFO L470 AbstractCegarLoop]: Abstraction has 656 states and 1271 transitions. [2021-11-25 19:08:32,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1271 transitions. [2021-11-25 19:08:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:08:32,098 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:32,098 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:08:32,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-25 19:08:32,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 19:08:32,314 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:08:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2112970223, now seen corresponding path program 6 times [2021-11-25 19:08:32,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:32,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546918055] [2021-11-25 19:08:32,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:32,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:32,827 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-25 19:08:32,827 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:32,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546918055] [2021-11-25 19:08:32,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546918055] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:32,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553058379] [2021-11-25 19:08:32,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:32,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:32,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:32,830 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:32,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:08:33,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:33,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:33,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:08:33,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:33,538 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-25 19:08:33,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:33,608 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-25 19:08:33,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:33,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:33,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:33,759 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-25 19:08:34,003 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-25 19:08:34,004 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 44 treesize of output 49 [2021-11-25 19:08:34,110 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:08:34,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2021-11-25 19:08:34,171 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-25 19:08:34,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:54,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_65|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_65|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335|) (and (forall ((v_ArrVal_1593 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_1593 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_1593 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))))) is different from false [2021-11-25 19:09:13,519 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-25 19:09:13,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553058379] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2018757206] [2021-11-25 19:09:13,520 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-25 19:09:13,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:13,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-25 19:09:13,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141426695] [2021-11-25 19:09:13,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:13,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 19:09:13,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 19:09:13,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=660, Unknown=15, NotChecked=54, Total=870 [2021-11-25 19:09:13,524 INFO L87 Difference]: Start difference. First operand 656 states and 1271 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:16,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int)) (or (< 0 |v_t_funThread1of1ForFork0_~i~0#1_65|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_65|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335|) (and (forall ((v_ArrVal_1593 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)))) (forall ((v_ArrVal_1593 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_1593 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_335| v_ArrVal_1593))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)))))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:09:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:17,027 INFO L93 Difference]: Finished difference Result 2422 states and 4811 transitions. [2021-11-25 19:09:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:09:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:09:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:17,045 INFO L225 Difference]: With dead ends: 2422 [2021-11-25 19:09:17,045 INFO L226 Difference]: Without dead ends: 2422 [2021-11-25 19:09:17,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=282, Invalid=1042, Unknown=16, NotChecked=142, Total=1482 [2021-11-25 19:09:17,047 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 347 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:17,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 241 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 773 Invalid, 0 Unknown, 674 Unchecked, 1.0s Time] [2021-11-25 19:09:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2021-11-25 19:09:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 659. [2021-11-25 19:09:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 652 states have (on average 1.9585889570552146) internal successors, (1277), 658 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1277 transitions. [2021-11-25 19:09:17,087 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1277 transitions. Word has length 45 [2021-11-25 19:09:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:17,087 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 1277 transitions. [2021-11-25 19:09:17,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1277 transitions. [2021-11-25 19:09:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:09:17,089 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:17,089 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-25 19:09:17,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:17,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 19:09:17,308 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:09:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1742148547, now seen corresponding path program 7 times [2021-11-25 19:09:17,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:17,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983835239] [2021-11-25 19:09:17,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:17,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:17,779 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-25 19:09:17,779 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:17,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983835239] [2021-11-25 19:09:17,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983835239] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:17,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379928881] [2021-11-25 19:09:17,780 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:09:17,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:17,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:17,781 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:17,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:09:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:17,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:09:17,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:18,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:09:18,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:18,378 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-25 19:09:18,699 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-25 19:09:18,699 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 35 treesize of output 37 [2021-11-25 19:09:18,801 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:09:18,801 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-25 19:09:18,937 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:09:18,938 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-25 19:09:19,020 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-25 19:09:19,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:37,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|) (and (forall ((v_ArrVal_1744 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| v_ArrVal_1744))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_1744 Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| v_ArrVal_1744))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2021-11-25 19:09:41,405 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-25 19:09:41,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379928881] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:41,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688541865] [2021-11-25 19:09:41,407 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-25 19:09:41,409 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:41,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-25 19:09:41,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094316430] [2021-11-25 19:09:41,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:41,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 19:09:41,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 19:09:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=624, Unknown=8, NotChecked=52, Total=812 [2021-11-25 19:09:41,411 INFO L87 Difference]: Start difference. First operand 659 states and 1277 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:43,824 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_66|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_66|) (and (forall ((v_ArrVal_1744 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| v_ArrVal_1744))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_1744 Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_336| v_ArrVal_1744))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-25 19:09:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:45,747 INFO L93 Difference]: Finished difference Result 1718 states and 3385 transitions. [2021-11-25 19:09:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-25 19:09:45,748 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:09:45,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:45,755 INFO L225 Difference]: With dead ends: 1718 [2021-11-25 19:09:45,755 INFO L226 Difference]: Without dead ends: 1715 [2021-11-25 19:09:45,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=449, Invalid=1356, Unknown=9, NotChecked=166, Total=1980 [2021-11-25 19:09:45,757 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 495 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:45,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 217 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1231 Invalid, 0 Unknown, 686 Unchecked, 1.6s Time] [2021-11-25 19:09:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2021-11-25 19:09:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 670. [2021-11-25 19:09:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 663 states have (on average 1.9607843137254901) internal successors, (1300), 669 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1300 transitions. [2021-11-25 19:09:45,792 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1300 transitions. Word has length 45 [2021-11-25 19:09:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:45,793 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1300 transitions. [2021-11-25 19:09:45,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1300 transitions. [2021-11-25 19:09:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:09:45,795 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:45,795 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-25 19:09:45,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:46,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:46,010 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:09:46,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash -332227623, now seen corresponding path program 8 times [2021-11-25 19:09:46,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:46,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252499189] [2021-11-25 19:09:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:46,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:46,571 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-25 19:09:46,571 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:46,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252499189] [2021-11-25 19:09:46,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252499189] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:46,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925197309] [2021-11-25 19:09:46,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:09:46,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:46,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:46,583 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:46,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:09:46,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:09:46,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:09:46,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:09:46,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:46,922 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-25 19:09:47,092 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-25 19:09:47,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,231 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-25 19:09:47,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,346 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-25 19:09:47,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,497 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-25 19:09:47,644 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:09:47,644 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-25 19:09:47,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:47,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2021-11-25 19:09:47,877 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-25 19:09:47,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:49,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:09:49,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:09:49,595 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-25 19:09:49,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925197309] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:49,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:09:49,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-25 19:09:49,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144587259] [2021-11-25 19:09:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:09:49,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:09:49,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:49,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:09:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:09:49,598 INFO L87 Difference]: Start difference. First operand 670 states and 1300 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:50,007 INFO L93 Difference]: Finished difference Result 898 states and 1750 transitions. [2021-11-25 19:09:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:09:50,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:09:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:50,010 INFO L225 Difference]: With dead ends: 898 [2021-11-25 19:09:50,010 INFO L226 Difference]: Without dead ends: 898 [2021-11-25 19:09:50,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:09:50,011 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:50,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2021-11-25 19:09:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-11-25 19:09:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 677. [2021-11-25 19:09:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 670 states have (on average 1.9611940298507462) internal successors, (1314), 676 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1314 transitions. [2021-11-25 19:09:50,037 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1314 transitions. Word has length 45 [2021-11-25 19:09:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:50,037 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 1314 transitions. [2021-11-25 19:09:50,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1314 transitions. [2021-11-25 19:09:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:09:50,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:50,040 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-25 19:09:50,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:50,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:50,258 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:09:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -229109223, now seen corresponding path program 9 times [2021-11-25 19:09:50,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893605244] [2021-11-25 19:09:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:50,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:50,711 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-25 19:09:50,711 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893605244] [2021-11-25 19:09:50,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893605244] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050890758] [2021-11-25 19:09:50,712 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:09:50,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:50,718 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:50,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:09:51,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:09:51,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:09:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:09:51,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:51,407 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-25 19:09:51,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:51,536 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-25 19:09:51,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:51,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:51,624 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-25 19:09:51,890 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-25 19:09:51,890 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 44 treesize of output 49 [2021-11-25 19:09:52,023 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:09:52,023 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-25 19:09:52,104 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-25 19:09:52,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:58,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (and (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|))) is different from false [2021-11-25 19:10:31,533 WARN L227 SmtUtils]: Spent 10.93s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:10:31,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:31,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:31,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:31,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:37,959 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-25 19:10:37,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050890758] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [272042013] [2021-11-25 19:10:37,960 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-25 19:10:37,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:37,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-25 19:10:37,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325620810] [2021-11-25 19:10:37,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:37,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 19:10:37,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 19:10:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=663, Unknown=12, NotChecked=54, Total=870 [2021-11-25 19:10:37,963 INFO L87 Difference]: Start difference. First operand 677 states and 1314 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:40,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| Int)) (or (and (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_2051 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338| v_ArrVal_2051))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3))))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_338|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:10:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:41,299 INFO L93 Difference]: Finished difference Result 1810 states and 3569 transitions. [2021-11-25 19:10:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-25 19:10:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:10:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:41,304 INFO L225 Difference]: With dead ends: 1810 [2021-11-25 19:10:41,304 INFO L226 Difference]: Without dead ends: 1810 [2021-11-25 19:10:41,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 48.1s TimeCoverageRelationStatistics Valid=304, Invalid=1173, Unknown=13, NotChecked=150, Total=1640 [2021-11-25 19:10:41,306 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 390 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:41,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 214 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 568 Invalid, 0 Unknown, 568 Unchecked, 0.8s Time] [2021-11-25 19:10:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2021-11-25 19:10:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 680. [2021-11-25 19:10:41,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 673 states have (on average 1.9613670133729568) internal successors, (1320), 679 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1320 transitions. [2021-11-25 19:10:41,337 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1320 transitions. Word has length 45 [2021-11-25 19:10:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:41,338 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 1320 transitions. [2021-11-25 19:10:41,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1320 transitions. [2021-11-25 19:10:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:10:41,340 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:41,340 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-25 19:10:41,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:41,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 19:10:41,558 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:10:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -668957749, now seen corresponding path program 10 times [2021-11-25 19:10:41,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167773683] [2021-11-25 19:10:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:41,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:42,008 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-25 19:10:42,008 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:42,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167773683] [2021-11-25 19:10:42,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167773683] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:42,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633656164] [2021-11-25 19:10:42,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:10:42,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:42,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:42,014 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:42,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:10:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:42,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:10:42,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:42,607 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-25 19:10:42,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:42,742 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-25 19:10:42,968 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-25 19:10:42,968 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 35 treesize of output 37 [2021-11-25 19:10:43,045 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:10:43,045 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-25 19:10:43,166 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:10:43,166 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-25 19:10:43,225 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-25 19:10:43,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:49,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339|) (and (forall ((v_ArrVal_2202 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_2202 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2021-11-25 19:10:51,950 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (v_ArrVal_2202 Int)) (or (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |c_~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 28) 1) v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 0) (<= 28 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114|))) (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (v_ArrVal_2202 Int)) (or (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 1)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) (+ |c_~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 28) 1) v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 0) (<= 28 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114|)))) is different from false [2021-11-25 19:10:51,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:52,185 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-25 19:10:52,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633656164] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:52,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258940016] [2021-11-25 19:10:52,186 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-25 19:10:52,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:52,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-25 19:10:52,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004444413] [2021-11-25 19:10:52,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:52,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 19:10:52,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:52,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 19:10:52,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=589, Unknown=3, NotChecked=102, Total=812 [2021-11-25 19:10:52,193 INFO L87 Difference]: Start difference. First operand 680 states and 1320 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:54,893 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (v_ArrVal_2202 Int)) (or (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |c_~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 28) 1) v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (< |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 0) (<= 28 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| Int) (v_ArrVal_2202 Int)) (or (< 0 (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 1)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) (+ |c_~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 28) 1) v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114| 0) (<= 28 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339_114|))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-25 19:10:56,852 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339|) (and (forall ((v_ArrVal_2202 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)))) (forall ((v_ArrVal_2202 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_339| v_ArrVal_2202))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-25 19:10:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:57,809 INFO L93 Difference]: Finished difference Result 2296 states and 4551 transitions. [2021-11-25 19:10:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:10:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:10:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:57,816 INFO L225 Difference]: With dead ends: 2296 [2021-11-25 19:10:57,817 INFO L226 Difference]: Without dead ends: 2296 [2021-11-25 19:10:57,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=261, Invalid=940, Unknown=5, NotChecked=276, Total=1482 [2021-11-25 19:10:57,819 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 320 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:57,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 214 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1013 Invalid, 0 Unknown, 528 Unchecked, 1.2s Time] [2021-11-25 19:10:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2021-11-25 19:10:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 683. [2021-11-25 19:10:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 676 states have (on average 1.9615384615384615) internal successors, (1326), 682 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1326 transitions. [2021-11-25 19:10:57,857 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1326 transitions. Word has length 45 [2021-11-25 19:10:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:57,858 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 1326 transitions. [2021-11-25 19:10:57,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1326 transitions. [2021-11-25 19:10:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:10:57,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:57,860 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-25 19:10:57,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:58,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 19:10:58,086 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:10:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -670312759, now seen corresponding path program 11 times [2021-11-25 19:10:58,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49746902] [2021-11-25 19:10:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:58,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 19:10:58,541 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49746902] [2021-11-25 19:10:58,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49746902] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741808779] [2021-11-25 19:10:58,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:10:58,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:58,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:58,543 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:58,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:10:58,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:10:58,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:58,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:10:58,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:58,848 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-25 19:10:59,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:10:59,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,184 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-25 19:10:59,288 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:10:59,289 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-25 19:10:59,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,419 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-25 19:10:59,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:59,528 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 43 treesize of output 48 [2021-11-25 19:10:59,641 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:10:59,642 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-25 19:10:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:10:59,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:11:00,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:11:00,975 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-25 19:11:00,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741808779] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:11:00,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:11:00,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 9] total 27 [2021-11-25 19:11:00,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484547178] [2021-11-25 19:11:00,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:11:00,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:11:00,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:11:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:11:00,979 INFO L87 Difference]: Start difference. First operand 683 states and 1326 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:01,169 INFO L93 Difference]: Finished difference Result 875 states and 1699 transitions. [2021-11-25 19:11:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:11:01,170 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:11:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:01,172 INFO L225 Difference]: With dead ends: 875 [2021-11-25 19:11:01,172 INFO L226 Difference]: Without dead ends: 875 [2021-11-25 19:11:01,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:11:01,173 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:01,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 235 Unchecked, 0.2s Time] [2021-11-25 19:11:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-11-25 19:11:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 684. [2021-11-25 19:11:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 677 states have (on average 1.9615952732644018) internal successors, (1328), 683 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1328 transitions. [2021-11-25 19:11:01,197 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1328 transitions. Word has length 45 [2021-11-25 19:11:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:01,198 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 1328 transitions. [2021-11-25 19:11:01,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1328 transitions. [2021-11-25 19:11:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:11:01,200 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:01,200 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-25 19:11:01,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-25 19:11:01,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:01,407 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:11:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash -670335079, now seen corresponding path program 12 times [2021-11-25 19:11:01,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:01,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511366679] [2021-11-25 19:11:01,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:01,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:02,024 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-25 19:11:02,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:02,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511366679] [2021-11-25 19:11:02,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511366679] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:11:02,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138543368] [2021-11-25 19:11:02,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:11:02,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:02,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:11:02,030 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:11:02,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 19:11:02,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:11:02,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:11:02,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:11:02,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:11:02,949 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-25 19:11:03,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,081 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-25 19:11:03,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,268 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-25 19:11:03,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:03,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-25 19:11:03,515 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-25 19:11:03,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 61 [2021-11-25 19:11:03,575 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-25 19:11:03,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:11:17,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| Int)) (or (and (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_2512 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341|))) is different from false [2021-11-25 19:11:37,421 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-25 19:11:37,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138543368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:11:37,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10720379] [2021-11-25 19:11:37,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-25 19:11:37,423 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:11:37,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-25 19:11:37,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308705557] [2021-11-25 19:11:37,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:11:37,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:11:37,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:11:37,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:11:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=726, Unknown=10, NotChecked=56, Total=930 [2021-11-25 19:11:37,425 INFO L87 Difference]: Start difference. First operand 684 states and 1328 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:40,715 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| Int)) (or (and (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_2512 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (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 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse5 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_2512 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) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341| v_ArrVal_2512))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_341|))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-25 19:11:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:11:43,243 INFO L93 Difference]: Finished difference Result 2065 states and 4078 transitions. [2021-11-25 19:11:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:11:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:11:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:11:43,248 INFO L225 Difference]: With dead ends: 2065 [2021-11-25 19:11:43,248 INFO L226 Difference]: Without dead ends: 2062 [2021-11-25 19:11:43,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=376, Invalid=1427, Unknown=11, NotChecked=166, Total=1980 [2021-11-25 19:11:43,250 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 345 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1289 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:11:43,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 243 Invalid, 2925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1518 Invalid, 0 Unknown, 1289 Unchecked, 2.7s Time] [2021-11-25 19:11:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2021-11-25 19:11:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 716. [2021-11-25 19:11:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 709 states have (on average 1.9661495063469676) internal successors, (1394), 715 states have internal predecessors, (1394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1394 transitions. [2021-11-25 19:11:43,283 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1394 transitions. Word has length 45 [2021-11-25 19:11:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:11:43,284 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1394 transitions. [2021-11-25 19:11:43,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:11:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1394 transitions. [2021-11-25 19:11:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:11:43,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:11:43,286 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-25 19:11:43,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-25 19:11:43,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:43,495 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:11:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:11:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2064413461, now seen corresponding path program 13 times [2021-11-25 19:11:43,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:11:43,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787425770] [2021-11-25 19:11:43,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:11:43,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:11:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:43,948 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-25 19:11:43,948 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:11:43,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787425770] [2021-11-25 19:11:43,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787425770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:11:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148996622] [2021-11-25 19:11:43,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:11:43,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:11:43,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:11:43,953 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:11:43,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 19:11:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:11:44,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:11:44,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:11:44,617 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-25 19:11:44,936 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-25 19:11:44,937 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 26 treesize of output 25 [2021-11-25 19:11:45,020 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-25 19:11:45,020 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-25 19:11:45,155 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:11:45,155 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-25 19:11:45,303 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:11:45,304 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-25 19:11:45,385 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-25 19:11:45,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:12:16,303 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-25 19:12:16,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148996622] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:12:16,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1786741887] [2021-11-25 19:12:16,305 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-25 19:12:16,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:12:16,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2021-11-25 19:12:16,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073744774] [2021-11-25 19:12:16,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:12:16,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 19:12:16,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 19:12:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=618, Unknown=15, NotChecked=0, Total=756 [2021-11-25 19:12:16,308 INFO L87 Difference]: Start difference. First operand 716 states and 1394 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:20,021 INFO L93 Difference]: Finished difference Result 1248 states and 2452 transitions. [2021-11-25 19:12:20,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:12:20,022 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:12:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:20,025 INFO L225 Difference]: With dead ends: 1248 [2021-11-25 19:12:20,025 INFO L226 Difference]: Without dead ends: 1248 [2021-11-25 19:12:20,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=580, Invalid=1757, Unknown=15, NotChecked=0, Total=2352 [2021-11-25 19:12:20,027 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 322 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:20,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 142 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1165 Invalid, 0 Unknown, 409 Unchecked, 2.1s Time] [2021-11-25 19:12:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2021-11-25 19:12:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 722. [2021-11-25 19:12:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 715 states have (on average 1.9664335664335664) internal successors, (1406), 721 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1406 transitions. [2021-11-25 19:12:20,054 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1406 transitions. Word has length 45 [2021-11-25 19:12:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:20,055 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1406 transitions. [2021-11-25 19:12:20,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1406 transitions. [2021-11-25 19:12:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:12:20,057 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:20,057 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-25 19:12:20,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:12:20,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:20,270 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:12:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash 309051415, now seen corresponding path program 14 times [2021-11-25 19:12:20,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:20,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973180909] [2021-11-25 19:12:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:20,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:20,946 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-25 19:12:20,947 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973180909] [2021-11-25 19:12:20,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973180909] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69631660] [2021-11-25 19:12:20,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:12:20,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:12:20,950 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:12:20,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:12:21,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:12:21,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:12:21,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:12:21,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:12:21,389 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-25 19:12:21,683 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-25 19:12:21,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:21,783 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-25 19:12:21,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:21,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:21,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:21,913 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-25 19:12:22,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,054 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-25 19:12:22,216 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:12:22,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-25 19:12:22,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:22,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2021-11-25 19:12:22,498 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-25 19:12:22,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:12:23,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:23,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:12:24,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:12:24,474 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-25 19:12:24,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69631660] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:24,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:12:24,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 27 [2021-11-25 19:12:24,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007344045] [2021-11-25 19:12:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:12:24,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:12:24,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:12:24,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:12:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:12:24,476 INFO L87 Difference]: Start difference. First operand 722 states and 1406 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:12:25,731 INFO L93 Difference]: Finished difference Result 1128 states and 2206 transitions. [2021-11-25 19:12:25,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 19:12:25,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:12:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:12:25,736 INFO L225 Difference]: With dead ends: 1128 [2021-11-25 19:12:25,736 INFO L226 Difference]: Without dead ends: 1128 [2021-11-25 19:12:25,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:12:25,738 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:12:25,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 41 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 347 Unchecked, 0.4s Time] [2021-11-25 19:12:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-11-25 19:12:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 733. [2021-11-25 19:12:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 726 states have (on average 1.9669421487603307) internal successors, (1428), 732 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1428 transitions. [2021-11-25 19:12:25,768 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1428 transitions. Word has length 45 [2021-11-25 19:12:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:12:25,768 INFO L470 AbstractCegarLoop]: Abstraction has 733 states and 1428 transitions. [2021-11-25 19:12:25,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:12:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1428 transitions. [2021-11-25 19:12:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:12:25,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:12:25,770 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-25 19:12:25,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:12:25,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-25 19:12:25,994 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:12:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:12:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash 412169815, now seen corresponding path program 15 times [2021-11-25 19:12:25,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:12:25,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256085585] [2021-11-25 19:12:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:12:25,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:12:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:12:26,574 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-25 19:12:26,575 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:12:26,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256085585] [2021-11-25 19:12:26,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256085585] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:12:26,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596347293] [2021-11-25 19:12:26,576 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:12:26,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:12:26,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:12:26,579 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:12:26,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 19:12:27,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:12:27,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:12:27,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-25 19:12:27,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:12:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:27,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 19:12:27,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:27,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:27,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:27,946 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-25 19:12:28,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:28,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:12:28,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-11-25 19:12:28,401 INFO L354 Elim1Store]: treesize reduction 134, result has 16.3 percent of original size [2021-11-25 19:12:28,401 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 44 treesize of output 49 [2021-11-25 19:12:28,629 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-25 19:12:28,630 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 53 treesize of output 61 [2021-11-25 19:12:28,795 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-25 19:12:28,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:08,053 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 77 treesize of output 71 [2021-11-25 19:13:16,431 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-25 19:13:16,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596347293] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:16,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1869207112] [2021-11-25 19:13:16,432 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:13:16,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:16,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2021-11-25 19:13:16,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768030438] [2021-11-25 19:13:16,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:16,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 19:13:16,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:16,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 19:13:16,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=811, Unknown=21, NotChecked=0, Total=992 [2021-11-25 19:13:16,436 INFO L87 Difference]: Start difference. First operand 733 states and 1428 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 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-25 19:13:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:20,538 INFO L93 Difference]: Finished difference Result 2055 states and 4059 transitions. [2021-11-25 19:13:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-25 19:13:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 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-25 19:13:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:20,545 INFO L225 Difference]: With dead ends: 2055 [2021-11-25 19:13:20,545 INFO L226 Difference]: Without dead ends: 2055 [2021-11-25 19:13:20,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=600, Invalid=2135, Unknown=21, NotChecked=0, Total=2756 [2021-11-25 19:13:20,548 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 363 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:20,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 147 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1207 Invalid, 0 Unknown, 623 Unchecked, 2.3s Time] [2021-11-25 19:13:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2021-11-25 19:13:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 746. [2021-11-25 19:13:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 739 states have (on average 1.9675236806495264) internal successors, (1454), 745 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1454 transitions. [2021-11-25 19:13:20,584 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1454 transitions. Word has length 45 [2021-11-25 19:13:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 1454 transitions. [2021-11-25 19:13:20,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 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-25 19:13:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1454 transitions. [2021-11-25 19:13:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:13:20,586 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:20,587 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-25 19:13:20,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:20,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 19:13:20,802 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:13:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 412147495, now seen corresponding path program 16 times [2021-11-25 19:13:20,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485573554] [2021-11-25 19:13:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:20,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:21,478 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-25 19:13:21,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:13:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485573554] [2021-11-25 19:13:21,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485573554] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:13:21,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994679534] [2021-11-25 19:13:21,480 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:13:21,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:13:21,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:13:21,481 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:13:21,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-25 19:13:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:13:21,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:13:21,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:13:22,309 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-25 19:13:22,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,408 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-25 19:13:22,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,522 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-25 19:13:22,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:13:22,805 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-25 19:13:22,993 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-25 19:13:22,994 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 53 treesize of output 61 [2021-11-25 19:13:23,075 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-25 19:13:23,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:13:25,700 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345|) (and (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_3122 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) is different from false [2021-11-25 19:13:53,406 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-25 19:13:53,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994679534] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [834673025] [2021-11-25 19:13:53,407 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-25 19:13:53,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:53,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-25 19:13:53,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587086672] [2021-11-25 19:13:53,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:53,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:13:53,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:53,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:13:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=719, Unknown=12, NotChecked=56, Total=930 [2021-11-25 19:13:53,410 INFO L87 Difference]: Start difference. First operand 746 states and 1454 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:57,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= (+ |c_~#cache~0.offset| 28) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345|) (and (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)))) (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)))) (forall ((v_ArrVal_3122 Int)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((v_ArrVal_3122 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_345| v_ArrVal_3122))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:13:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:13:59,382 INFO L93 Difference]: Finished difference Result 2362 states and 4672 transitions. [2021-11-25 19:13:59,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:13:59,383 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:13:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:13:59,391 INFO L225 Difference]: With dead ends: 2362 [2021-11-25 19:13:59,391 INFO L226 Difference]: Without dead ends: 2360 [2021-11-25 19:13:59,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=215, Invalid=970, Unknown=13, NotChecked=134, Total=1332 [2021-11-25 19:13:59,393 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 353 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1011 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:13:59,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 307 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1998 Invalid, 0 Unknown, 1011 Unchecked, 3.6s Time] [2021-11-25 19:13:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2021-11-25 19:13:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 748. [2021-11-25 19:13:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 741 states have (on average 1.9676113360323886) internal successors, (1458), 747 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1458 transitions. [2021-11-25 19:13:59,431 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1458 transitions. Word has length 45 [2021-11-25 19:13:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:13:59,432 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1458 transitions. [2021-11-25 19:13:59,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1458 transitions. [2021-11-25 19:13:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:13:59,434 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:13:59,434 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-25 19:13:59,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-25 19:13:59,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-25 19:13:59,656 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:13:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:13:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -27678711, now seen corresponding path program 17 times [2021-11-25 19:13:59,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:13:59,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61561024] [2021-11-25 19:13:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:13:59,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:13:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:00,197 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-25 19:14:00,197 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:00,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61561024] [2021-11-25 19:14:00,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61561024] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:00,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975871065] [2021-11-25 19:14:00,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:14:00,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:00,200 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:00,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-25 19:14:00,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:14:00,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:14:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:14:00,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:00,679 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-25 19:14:01,048 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-25 19:14:01,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:01,169 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-25 19:14:01,320 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:14:01,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2021-11-25 19:14:01,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:01,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:01,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:01,466 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 34 treesize of output 36 [2021-11-25 19:14:01,569 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:14:01,570 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-25 19:14:01,703 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:14:01,703 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-25 19:14:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:14:01,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:02,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:02,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2021-11-25 19:14:02,726 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-25 19:14:02,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975871065] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:02,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:14:02,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2021-11-25 19:14:02,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328056000] [2021-11-25 19:14:02,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:02,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 19:14:02,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 19:14:02,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2021-11-25 19:14:02,729 INFO L87 Difference]: Start difference. First operand 748 states and 1458 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:03,751 INFO L93 Difference]: Finished difference Result 1160 states and 2275 transitions. [2021-11-25 19:14:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 19:14:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:14:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:03,753 INFO L225 Difference]: With dead ends: 1160 [2021-11-25 19:14:03,754 INFO L226 Difference]: Without dead ends: 1160 [2021-11-25 19:14:03,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:14:03,755 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:03,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 42 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 248 Unchecked, 0.4s Time] [2021-11-25 19:14:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2021-11-25 19:14:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 750. [2021-11-25 19:14:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 743 states have (on average 1.9676985195154777) internal successors, (1462), 749 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1462 transitions. [2021-11-25 19:14:03,783 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1462 transitions. Word has length 45 [2021-11-25 19:14:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:03,783 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1462 transitions. [2021-11-25 19:14:03,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1462 transitions. [2021-11-25 19:14:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:03,785 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:03,786 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-25 19:14:03,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:14:04,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-25 19:14:04,012 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash -29033721, now seen corresponding path program 18 times [2021-11-25 19:14:04,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:04,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437414366] [2021-11-25 19:14:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:04,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:04,550 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-25 19:14:04,551 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437414366] [2021-11-25 19:14:04,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437414366] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284314706] [2021-11-25 19:14:04,551 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:14:04,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:04,552 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:04,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-25 19:14:05,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:14:05,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:14:05,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2021-11-25 19:14:05,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:05,795 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-25 19:14:05,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:05,906 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-25 19:14:06,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,169 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-25 19:14:06,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,312 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-25 19:14:06,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:06,452 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-25 19:14:06,567 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-25 19:14:06,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:07,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:07,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:07,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:07,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:08,218 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-25 19:14:08,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284314706] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:14:08,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [397882104] [2021-11-25 19:14:08,219 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-25 19:14:08,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:14:08,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-25 19:14:08,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153816118] [2021-11-25 19:14:08,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:14:08,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-25 19:14:08,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-25 19:14:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2021-11-25 19:14:08,222 INFO L87 Difference]: Start difference. First operand 750 states and 1462 transitions. Second operand has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:12,245 INFO L93 Difference]: Finished difference Result 1841 states and 3629 transitions. [2021-11-25 19:14:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 19:14:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:14:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:12,248 INFO L225 Difference]: With dead ends: 1841 [2021-11-25 19:14:12,248 INFO L226 Difference]: Without dead ends: 1838 [2021-11-25 19:14:12,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=435, Invalid=1457, Unknown=0, NotChecked=0, Total=1892 [2021-11-25 19:14:12,250 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 377 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:12,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 183 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1400 Invalid, 0 Unknown, 419 Unchecked, 2.6s Time] [2021-11-25 19:14:12,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-11-25 19:14:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 763. [2021-11-25 19:14:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 756 states have (on average 1.9682539682539681) internal successors, (1488), 762 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1488 transitions. [2021-11-25 19:14:12,283 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1488 transitions. Word has length 45 [2021-11-25 19:14:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:12,284 INFO L470 AbstractCegarLoop]: Abstraction has 763 states and 1488 transitions. [2021-11-25 19:14:12,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1488 transitions. [2021-11-25 19:14:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:12,286 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:12,286 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-25 19:14:12,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-25 19:14:12,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:12,502 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1589274797, now seen corresponding path program 19 times [2021-11-25 19:14:12,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:12,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185249417] [2021-11-25 19:14:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:12,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:12,967 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-25 19:14:12,967 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:12,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185249417] [2021-11-25 19:14:12,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185249417] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:12,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547082328] [2021-11-25 19:14:12,968 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:14:12,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:12,969 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:12,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-25 19:14:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:13,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:14:13,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:13,815 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-25 19:14:14,077 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-25 19:14:14,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-25 19:14:14,148 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-25 19:14:14,149 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-25 19:14:14,255 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:14:14,255 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-25 19:14:14,395 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:14:14,395 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-25 19:14:14,478 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-25 19:14:14,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:30,794 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-25 19:14:30,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547082328] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:14:30,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732924901] [2021-11-25 19:14:30,795 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-25 19:14:30,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:14:30,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2021-11-25 19:14:30,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750293615] [2021-11-25 19:14:30,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:14:30,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 19:14:30,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 19:14:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=633, Unknown=6, NotChecked=0, Total=756 [2021-11-25 19:14:30,798 INFO L87 Difference]: Start difference. First operand 763 states and 1488 transitions. Second operand has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:36,468 INFO L93 Difference]: Finished difference Result 1822 states and 3597 transitions. [2021-11-25 19:14:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:14:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:14:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:36,472 INFO L225 Difference]: With dead ends: 1822 [2021-11-25 19:14:36,472 INFO L226 Difference]: Without dead ends: 1818 [2021-11-25 19:14:36,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=601, Invalid=1943, Unknown=6, NotChecked=0, Total=2550 [2021-11-25 19:14:36,474 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 517 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:36,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 177 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2132 Invalid, 0 Unknown, 574 Unchecked, 3.8s Time] [2021-11-25 19:14:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2021-11-25 19:14:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 719. [2021-11-25 19:14:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 712 states have (on average 1.9648876404494382) internal successors, (1399), 718 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1399 transitions. [2021-11-25 19:14:36,502 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1399 transitions. Word has length 45 [2021-11-25 19:14:36,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:36,503 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 1399 transitions. [2021-11-25 19:14:36,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 28 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1399 transitions. [2021-11-25 19:14:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:36,505 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:36,505 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-25 19:14:36,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:14:36,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:36,718 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:36,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -81435775, now seen corresponding path program 20 times [2021-11-25 19:14:36,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:36,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586893446] [2021-11-25 19:14:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:36,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:37,147 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-25 19:14:37,147 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586893446] [2021-11-25 19:14:37,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586893446] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779528031] [2021-11-25 19:14:37,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:14:37,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:37,148 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:37,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-25 19:14:37,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:14:37,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:14:37,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-25 19:14:37,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:37,564 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-25 19:14:37,749 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:14:37,750 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-25 19:14:37,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:14:37,895 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-25 19:14:37,982 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-25 19:14:37,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-25 19:14:38,081 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:14:38,082 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-25 19:14:38,222 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:14:38,222 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-25 19:14:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:14:38,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:38,746 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-25 19:14:38,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779528031] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:38,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:14:38,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 22 [2021-11-25 19:14:38,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564816671] [2021-11-25 19:14:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:14:38,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 19:14:38,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 19:14:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2021-11-25 19:14:38,748 INFO L87 Difference]: Start difference. First operand 719 states and 1399 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-25 19:14:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:40,637 INFO L93 Difference]: Finished difference Result 1594 states and 3142 transitions. [2021-11-25 19:14:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 19:14:40,638 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-25 19:14:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:40,641 INFO L225 Difference]: With dead ends: 1594 [2021-11-25 19:14:40,641 INFO L226 Difference]: Without dead ends: 1594 [2021-11-25 19:14:40,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 84 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2021-11-25 19:14:40,642 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 176 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:40,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 16 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 615 Invalid, 0 Unknown, 22 Unchecked, 1.2s Time] [2021-11-25 19:14:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2021-11-25 19:14:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 920. [2021-11-25 19:14:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 913 states have (on average 2.009857612267251) internal successors, (1835), 919 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1835 transitions. [2021-11-25 19:14:40,674 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1835 transitions. Word has length 45 [2021-11-25 19:14:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:40,674 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 1835 transitions. [2021-11-25 19:14:40,674 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-25 19:14:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1835 transitions. [2021-11-25 19:14:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:40,676 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:40,676 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-25 19:14:40,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:14:40,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-25 19:14:40,902 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -178852345, now seen corresponding path program 21 times [2021-11-25 19:14:40,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:40,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886834725] [2021-11-25 19:14:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:40,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:41,447 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-25 19:14:41,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:41,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886834725] [2021-11-25 19:14:41,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886834725] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:41,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969866470] [2021-11-25 19:14:41,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:14:41,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:41,450 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:41,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-25 19:14:42,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:14:42,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:14:42,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 19:14:42,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:42,656 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-25 19:14:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:42,760 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-25 19:14:42,890 INFO L354 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2021-11-25 19:14:42,890 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 35 treesize of output 37 [2021-11-25 19:14:42,997 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-25 19:14:42,997 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-25 19:14:43,144 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-25 19:14:43,145 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-25 19:14:43,226 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-25 19:14:43,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:43,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:14:44,021 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-25 19:14:44,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969866470] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:14:44,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11447783] [2021-11-25 19:14:44,022 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-25 19:14:44,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:14:44,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-25 19:14:44,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48155836] [2021-11-25 19:14:44,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:14:44,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-25 19:14:44,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-25 19:14:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2021-11-25 19:14:44,024 INFO L87 Difference]: Start difference. First operand 920 states and 1835 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:48,045 INFO L93 Difference]: Finished difference Result 2485 states and 4986 transitions. [2021-11-25 19:14:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-25 19:14:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-25 19:14:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:48,049 INFO L225 Difference]: With dead ends: 2485 [2021-11-25 19:14:48,049 INFO L226 Difference]: Without dead ends: 2481 [2021-11-25 19:14:48,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2021-11-25 19:14:48,050 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 453 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:48,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 182 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1543 Invalid, 0 Unknown, 64 Unchecked, 2.7s Time] [2021-11-25 19:14:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2021-11-25 19:14:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 1059. [2021-11-25 19:14:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 1052 states have (on average 2.0161596958174903) internal successors, (2121), 1058 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2121 transitions. [2021-11-25 19:14:48,080 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2121 transitions. Word has length 45 [2021-11-25 19:14:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:48,081 INFO L470 AbstractCegarLoop]: Abstraction has 1059 states and 2121 transitions. [2021-11-25 19:14:48,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 29 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2121 transitions. [2021-11-25 19:14:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:48,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:48,083 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-25 19:14:48,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2021-11-25 19:14:48,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-11-25 19:14:48,302 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:48,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 751274168, now seen corresponding path program 1 times [2021-11-25 19:14:48,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:48,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641307815] [2021-11-25 19:14:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:48,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-25 19:14:48,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:48,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641307815] [2021-11-25 19:14:48,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641307815] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909304660] [2021-11-25 19:14:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:48,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:48,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:48,802 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:48,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-25 19:14:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:49,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 19:14:49,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:49,958 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-25 19:14:50,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2021-11-25 19:14:50,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,148 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-25 19:14:50,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,241 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-25 19:14:50,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:50,342 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-25 19:14:50,436 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-25 19:14:50,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:51,018 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-25 19:14:51,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909304660] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:14:51,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [322174108] [2021-11-25 19:14:51,019 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-25 19:14:51,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:14:51,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2021-11-25 19:14:51,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513342976] [2021-11-25 19:14:51,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:14:51,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-25 19:14:51,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:14:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-25 19:14:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-11-25 19:14:51,023 INFO L87 Difference]: Start difference. First operand 1059 states and 2121 transitions. Second operand has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:56,855 INFO L93 Difference]: Finished difference Result 2349 states and 4722 transitions. [2021-11-25 19:14:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-25 19:14:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 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-25 19:14:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:56,860 INFO L225 Difference]: With dead ends: 2349 [2021-11-25 19:14:56,860 INFO L226 Difference]: Without dead ends: 2345 [2021-11-25 19:14:56,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=645, Invalid=2547, Unknown=0, NotChecked=0, Total=3192 [2021-11-25 19:14:56,862 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 422 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:56,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 116 Invalid, 2638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2385 Invalid, 0 Unknown, 81 Unchecked, 4.1s Time] [2021-11-25 19:14:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2021-11-25 19:14:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1143. [2021-11-25 19:14:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1136 states have (on average 2.0149647887323945) internal successors, (2289), 1142 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 2289 transitions. [2021-11-25 19:14:56,899 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 2289 transitions. Word has length 45 [2021-11-25 19:14:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:56,900 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 2289 transitions. [2021-11-25 19:14:56,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 2289 transitions. [2021-11-25 19:14:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:14:56,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:56,902 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-25 19:14:56,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-11-25 19:14:57,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:57,118 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:14:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 918896645, now seen corresponding path program 1 times [2021-11-25 19:14:57,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:57,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830243009] [2021-11-25 19:14:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:57,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:58,026 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-25 19:14:58,026 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:58,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830243009] [2021-11-25 19:14:58,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830243009] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:58,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726279270] [2021-11-25 19:14:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:58,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:58,029 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:58,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-25 19:14:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:58,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:14:58,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:58,683 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-25 19:14:58,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:58,775 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-25 19:14:58,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:58,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:58,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:58,910 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-25 19:14:59,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,066 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-25 19:14:59,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,498 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-25 19:14:59,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,560 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 48 treesize of output 56 [2021-11-25 19:14:59,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,624 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 48 treesize of output 56 [2021-11-25 19:14:59,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:59,678 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 48 treesize of output 56 [2021-11-25 19:14:59,883 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-25 19:14:59,884 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 53 treesize of output 61 [2021-11-25 19:14:59,980 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-25 19:14:59,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:15:10,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_82| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_82|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (and (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_82|))) is different from false [2021-11-25 19:15:21,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_82| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (and (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (select .cse3 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_~#cache~0.base| (store (store (select .cse4 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_82|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_82|))) is different from false [2021-11-25 19:15:24,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_82| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (and (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 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 (select .cse0 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (select .cse4 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (select .cse5 |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_82|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_82|))) is different from false [2021-11-25 19:15:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2021-11-25 19:15:27,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726279270] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:15:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [322576250] [2021-11-25 19:15:27,112 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-25 19:15:27,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:15:27,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2021-11-25 19:15:27,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752656082] [2021-11-25 19:15:27,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:15:27,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 19:15:27,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 19:15:27,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=650, Unknown=10, NotChecked=168, Total=992 [2021-11-25 19:15:27,116 INFO L87 Difference]: Start difference. First operand 1143 states and 2289 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-25 19:16:00,141 WARN L227 SmtUtils]: Spent 30.14s on a formula simplification. DAG size of input: 60 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 19:16:02,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_82| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| Int)) (or (< (+ |c_~#cache~0.offset| (* 28 |v_t_funThread1of1ForFork0_~i~0#1_82|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) (and (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) 0)) (forall ((v_ArrVal_4196 Int) (v_ArrVal_4197 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (select |c_#race| |c_~#cache~0.base|) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352|) v_ArrVal_4196) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_352| v_ArrVal_4197)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (< 0 |v_t_funThread1of1ForFork0_~i~0#1_82|))) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) 0) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= 0 (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (<= 1 (div (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-25 19:16:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:05,142 INFO L93 Difference]: Finished difference Result 4425 states and 8970 transitions. [2021-11-25 19:16:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-25 19:16:05,143 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-25 19:16:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:05,151 INFO L225 Difference]: With dead ends: 4425 [2021-11-25 19:16:05,151 INFO L226 Difference]: Without dead ends: 4424 [2021-11-25 19:16:05,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=361, Invalid=1365, Unknown=12, NotChecked=332, Total=2070 [2021-11-25 19:16:05,153 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 492 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 3235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1720 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:05,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 255 Invalid, 3235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1336 Invalid, 0 Unknown, 1720 Unchecked, 2.8s Time] [2021-11-25 19:16:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2021-11-25 19:16:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 1156. [2021-11-25 19:16:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1149 states have (on average 2.0147954743255005) internal successors, (2315), 1155 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2315 transitions. [2021-11-25 19:16:05,202 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2315 transitions. Word has length 45 [2021-11-25 19:16:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:05,203 INFO L470 AbstractCegarLoop]: Abstraction has 1156 states and 2315 transitions. [2021-11-25 19:16:05,203 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-25 19:16:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2315 transitions. [2021-11-25 19:16:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-25 19:16:05,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:05,206 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-25 19:16:05,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:05,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-25 19:16:05,434 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash -575781913, now seen corresponding path program 2 times [2021-11-25 19:16:05,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:16:05,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693351100] [2021-11-25 19:16:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:05,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:16:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:06,530 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-25 19:16:06,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:16:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693351100] [2021-11-25 19:16:06,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693351100] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:16:06,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185286238] [2021-11-25 19:16:06,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:16:06,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:06,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:16:06,532 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:16:06,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 19:16:06,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:16:06,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:06,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:16:06,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:07,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 19:16:07,284 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-25 19:16:07,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,412 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-25 19:16:07,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,542 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-25 19:16:07,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:07,853 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-25 19:16:08,080 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:16:08,080 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-25 19:16:08,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,338 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-25 19:16:08,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2021-11-25 19:16:08,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2021-11-25 19:16:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:08,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2021-11-25 19:16:09,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:09,334 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 67 treesize of output 84 [2021-11-25 19:16:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:16:09,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:15,034 INFO L354 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2021-11-25 19:16:15,035 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 17816 treesize of output 17808 [2021-11-25 19:16:15,933 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:16:15,934 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 11687 treesize of output 11679 [2021-11-25 19:16:16,089 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-25 19:16:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1982946785] [2021-11-25 19:16:16,091 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-25 19:16:16,093 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:16:16,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2021-11-25 19:16:16,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746619891] [2021-11-25 19:16:16,094 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:16:16,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:16:16,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:16:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:16:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 19:16:16,097 INFO L87 Difference]: Start difference. First operand 1156 states and 2315 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 19:16:16,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 19:16:16,100 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:16,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:16:16,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:16,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:16,314 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@43d9d283 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:16:16,316 INFO L158 Benchmark]: Toolchain (without parser) took 586923.32ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 119.9MB in the beginning and 142.1MB in the end (delta: -22.3MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,316 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:16:16,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 894.78ms. Allocated memory is still 155.2MB. Free memory was 119.5MB in the beginning and 111.6MB in the end (delta: 7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.32ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,317 INFO L158 Benchmark]: Boogie Preprocessor took 85.96ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,317 INFO L158 Benchmark]: RCFGBuilder took 650.20ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 93.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,317 INFO L158 Benchmark]: TraceAbstraction took 585168.12ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 92.9MB in the beginning and 142.1MB in the end (delta: -49.2MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2021-11-25 19:16:16,318 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 96.5MB. Free memory was 50.2MB in the beginning and 50.1MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 894.78ms. Allocated memory is still 155.2MB. Free memory was 119.5MB in the beginning and 111.6MB in the end (delta: 7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.32ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 109.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.96ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 106.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 650.20ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 93.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 585168.12ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 92.9MB in the beginning and 142.1MB in the end (delta: -49.2MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 104 PlacesBefore, 42 PlacesAfterwards, 106 TransitionsBefore, 41 TransitionsAfterwards, 3192 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 68 TotalNumberOfCompositions, 8972 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2826, positive: 2495, positive conditional: 0, positive unconditional: 2495, negative: 331, negative conditional: 0, negative unconditional: 331, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1797, positive: 1717, positive conditional: 0, positive unconditional: 1717, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1797, positive: 1664, positive conditional: 0, positive unconditional: 1664, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 274, negative conditional: 0, negative unconditional: 274, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2826, positive: 778, positive conditional: 0, positive unconditional: 778, negative: 251, negative conditional: 0, negative unconditional: 251, unknown: 1797, unknown conditional: 0, unknown unconditional: 1797] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@43d9d283 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@43d9d283: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-25 19:16:16,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:16:19,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:16:19,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:16:19,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:16:19,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:16:19,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:16:19,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:16:19,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:16:19,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:16:19,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:16:19,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:16:19,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:16:19,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:16:19,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:16:19,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:16:19,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:16:19,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:16:19,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:16:19,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:16:19,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:16:19,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:16:19,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:16:19,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:16:19,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:16:19,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:16:19,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:16:19,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:16:19,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:16:19,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:16:19,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:16:19,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:16:19,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:16:19,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:16:19,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:16:19,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:16:19,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:16:19,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:16:19,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:16:19,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:16:19,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:16:19,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:16:19,175 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/config/svcomp-DataRace-32bit-Taipan_Bitvector.epf [2021-11-25 19:16:19,213 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:16:19,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:16:19,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:16:19,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:16:19,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:16:19,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:16:19,220 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:16:19,221 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:16:19,222 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:16:19,222 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:16:19,226 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:16:19,227 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:16:19,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:16:19,229 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:16:19,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 19:16:19,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:16:19,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:16:19,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:16:19,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:16:19,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:16:19,232 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-25 19:16:19,232 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-25 19:16:19,233 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-25 19:16:19,233 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:16:19,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:16:19,234 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:16:19,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:16:19,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:16:19,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-25 19:16:19,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:16:19,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:16:19,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:16:19,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:16:19,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:16:19,238 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-25 19:16:19,239 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-25 19:16:19,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:16:19,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:16:19,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:16:19,241 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/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_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2021-11-25 19:16:19,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:16:19,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:16:19,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:16:19,716 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:16:19,717 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:16:19,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-25 19:16:19,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/84819da11/fc9f3b3232cd4725b1802b2955657c6d/FLAG20fc449a3 [2021-11-25 19:16:20,527 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:16:20,527 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-25 19:16:20,560 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/84819da11/fc9f3b3232cd4725b1802b2955657c6d/FLAG20fc449a3 [2021-11-25 19:16:20,769 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/data/84819da11/fc9f3b3232cd4725b1802b2955657c6d [2021-11-25 19:16:20,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:16:20,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:16:20,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:16:20,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:16:20,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:16:20,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:16:20" (1/1) ... [2021-11-25 19:16:20,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6ce664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:20, skipping insertion in model container [2021-11-25 19:16:20,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:16:20" (1/1) ... [2021-11-25 19:16:20,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:16:20,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:16:21,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:16:21,668 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:16:21,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:16:21,829 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:16:21,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21 WrapperNode [2021-11-25 19:16:21,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:16:21,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:16:21,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:16:21,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:16:21,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,921 INFO L137 Inliner]: procedures = 265, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2021-11-25 19:16:21,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:16:21,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:16:21,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:16:21,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:16:21,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:21,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:22,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:22,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:22,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:16:22,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:16:22,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:16:22,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:16:22,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (1/1) ... [2021-11-25 19:16:22,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:16:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:16:22,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:16:22,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:16:22,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-25 19:16:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:16:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:16:22,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-25 19:16:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 19:16:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:16:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-25 19:16:22,154 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-25 19:16:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:16:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:16:22,157 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:16:22,408 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:16:22,410 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:16:22,708 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:16:22,718 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:16:22,718 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-25 19:16:22,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:16:22 BoogieIcfgContainer [2021-11-25 19:16:22,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:16:22,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:16:22,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:16:22,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:16:22,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:16:20" (1/3) ... [2021-11-25 19:16:22,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acb1189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:16:22, skipping insertion in model container [2021-11-25 19:16:22,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:16:21" (2/3) ... [2021-11-25 19:16:22,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acb1189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:16:22, skipping insertion in model container [2021-11-25 19:16:22,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:16:22" (3/3) ... [2021-11-25 19:16:22,733 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2021-11-25 19:16:22,739 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:16:22,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:16:22,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-25 19:16:22,740 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:16:22,791 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,806 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,807 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,808 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,809 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,810 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,811 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,812 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,813 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,814 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,814 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-25 19:16:22,814 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-25 19:16:22,815 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,815 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-25 19:16:22,815 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-25 19:16:22,815 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-25 19:16:22,816 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-25 19:16:22,816 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-25 19:16:22,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-25 19:16:22,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-25 19:16:22,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-25 19:16:22,817 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-25 19:16:22,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-25 19:16:22,818 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-25 19:16:22,818 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-25 19:16:22,818 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-25 19:16:22,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-25 19:16:22,819 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-25 19:16:22,819 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-25 19:16:22,819 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-25 19:16:22,820 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-25 19:16:22,820 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-25 19:16:22,820 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-25 19:16:22,820 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-25 19:16:22,821 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-25 19:16:22,821 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-25 19:16:22,821 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-25 19:16:22,822 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-25 19:16:22,822 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-25 19:16:22,822 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-25 19:16:22,823 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-25 19:16:22,823 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-25 19:16:22,823 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-25 19:16:22,824 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-25 19:16:22,824 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-25 19:16:22,824 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-25 19:16:22,824 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-25 19:16:22,825 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-25 19:16:22,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-25 19:16:22,825 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-25 19:16:22,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-25 19:16:22,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-25 19:16:22,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-25 19:16:22,827 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-25 19:16:22,827 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-25 19:16:22,827 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-25 19:16:22,827 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-25 19:16:22,828 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-25 19:16:22,828 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-25 19:16:22,828 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-25 19:16:22,829 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-25 19:16:22,829 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-25 19:16:22,829 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-25 19:16:22,830 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-25 19:16:22,830 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-25 19:16:22,830 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-25 19:16:22,831 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-25 19:16:22,831 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-25 19:16:22,831 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-25 19:16:22,832 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-25 19:16:22,832 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-25 19:16:22,832 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-25 19:16:22,833 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-25 19:16:22,833 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-25 19:16:22,833 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-25 19:16:22,834 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-25 19:16:22,834 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-25 19:16:22,834 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-25 19:16:22,835 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-25 19:16:22,835 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-25 19:16:22,835 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-25 19:16:22,835 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-25 19:16:22,836 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-25 19:16:22,836 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-25 19:16:22,836 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-25 19:16:22,837 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-25 19:16:22,837 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-25 19:16:22,837 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-25 19:16:22,838 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-25 19:16:22,838 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-25 19:16:22,838 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-25 19:16:22,838 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-25 19:16:22,839 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-25 19:16:22,839 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-25 19:16:22,839 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-25 19:16:22,840 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-25 19:16:22,840 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-25 19:16:22,840 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-25 19:16:22,841 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-25 19:16:22,841 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-25 19:16:22,841 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-25 19:16:22,841 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-25 19:16:22,842 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-25 19:16:22,842 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-25 19:16:22,842 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-25 19:16:22,843 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-25 19:16:22,843 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-25 19:16:22,843 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-25 19:16:22,844 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-25 19:16:22,844 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-25 19:16:22,844 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-25 19:16:22,844 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-25 19:16:22,845 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-25 19:16:22,845 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-25 19:16:22,845 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-25 19:16:22,846 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-25 19:16:22,846 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-25 19:16:22,846 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-25 19:16:22,847 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-25 19:16:22,847 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-25 19:16:22,847 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-25 19:16:22,848 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-25 19:16:22,848 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-25 19:16:22,849 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-25 19:16:22,849 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-25 19:16:22,849 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-25 19:16:22,849 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-25 19:16:22,864 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-25 19:16:22,864 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-25 19:16:22,865 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-25 19:16:22,865 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-25 19:16:22,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,873 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,874 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-25 19:16:22,874 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-25 19:16:22,874 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-25 19:16:22,875 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-25 19:16:22,875 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-25 19:16:22,875 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-25 19:16:22,876 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-25 19:16:22,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,876 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,877 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:16:22,877 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-25 19:16:22,880 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-25 19:16:22,933 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:16:22,942 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-25 19:16:22,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-25 19:16:22,962 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:16:22,980 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 107 transitions, 219 flow [2021-11-25 19:16:22,984 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 107 transitions, 219 flow [2021-11-25 19:16:23,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 219 flow [2021-11-25 19:16:23,070 INFO L129 PetriNetUnfolder]: 6/106 cut-off events. [2021-11-25 19:16:23,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-25 19:16:23,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 6/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 136 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2021-11-25 19:16:23,082 INFO L116 LiptonReduction]: Number of co-enabled transitions 3192 [2021-11-25 19:16:28,822 INFO L131 LiptonReduction]: Checked pairs total: 9060 [2021-11-25 19:16:28,822 INFO L133 LiptonReduction]: Total number of compositions: 69 [2021-11-25 19:16:28,833 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2021-11-25 19:16:28,866 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 19:16:28,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:28,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:28,881 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:28,887 INFO L85 PathProgramCache]: Analyzing trace with hash 800263480, now seen corresponding path program 1 times [2021-11-25 19:16:28,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:28,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199301540] [2021-11-25 19:16:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:28,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:28,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:28,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:28,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-25 19:16:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:29,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:16:29,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:29,120 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-25 19:16:29,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:29,122 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:29,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199301540] [2021-11-25 19:16:29,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199301540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:29,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:29,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:16:29,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612579217] [2021-11-25 19:16:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:29,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:16:29,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:16:29,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:16:29,163 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:29,350 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2021-11-25 19:16:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:16:29,353 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-25 19:16:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:29,403 INFO L225 Difference]: With dead ends: 327 [2021-11-25 19:16:29,404 INFO L226 Difference]: Without dead ends: 327 [2021-11-25 19:16:29,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 19:16:29,422 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:29,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:16:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-25 19:16:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-11-25 19:16:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2021-11-25 19:16:29,533 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2021-11-25 19:16:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:29,533 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2021-11-25 19:16:29,534 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-25 19:16:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2021-11-25 19:16:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 19:16:29,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:29,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:29,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:29,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:29,743 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1334010007, now seen corresponding path program 1 times [2021-11-25 19:16:29,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:29,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492011983] [2021-11-25 19:16:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:29,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:29,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:29,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-25 19:16:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:29,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:16:29,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:29,972 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-25 19:16:29,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:30,053 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-25 19:16:30,054 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492011983] [2021-11-25 19:16:30,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492011983] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:30,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1796167161] [2021-11-25 19:16:30,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:30,070 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:16:30,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:16:30,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:16:30,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2021-11-25 19:16:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:30,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:16:30,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:30,308 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-25 19:16:30,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:30,355 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-25 19:16:30,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1796167161] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:30,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335227224] [2021-11-25 19:16:30,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:30,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:30,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:16:30,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:16:30,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:16:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:30,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:16:30,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:30,506 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-25 19:16:30,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:30,557 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-25 19:16:30,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335227224] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:30,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:16:30,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 3, 3] total 5 [2021-11-25 19:16:30,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270437792] [2021-11-25 19:16:30,561 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:16:30,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:30,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:30,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:30,567 INFO L87 Difference]: Start difference. First operand 327 states and 651 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:30,797 INFO L93 Difference]: Finished difference Result 330 states and 654 transitions. [2021-11-25 19:16:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:30,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-25 19:16:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:30,813 INFO L225 Difference]: With dead ends: 330 [2021-11-25 19:16:30,813 INFO L226 Difference]: Without dead ends: 330 [2021-11-25 19:16:30,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:16:30,816 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:30,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:16:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-25 19:16:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-25 19:16:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 322 states have (on average 2.031055900621118) internal successors, (654), 329 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 654 transitions. [2021-11-25 19:16:30,865 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 654 transitions. Word has length 12 [2021-11-25 19:16:30,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:30,865 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 654 transitions. [2021-11-25 19:16:30,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:30,866 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 654 transitions. [2021-11-25 19:16:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 19:16:30,867 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:30,868 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:30,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:31,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-25 19:16:31,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-25 19:16:31,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:31,471 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -891523848, now seen corresponding path program 2 times [2021-11-25 19:16:31,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946684561] [2021-11-25 19:16:31,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:31,473 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:31,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:31,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-25 19:16:31,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:31,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:31,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:31,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:31,656 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-25 19:16:31,695 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:31,696 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 25 treesize of output 27 [2021-11-25 19:16:31,823 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:31,824 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 35 treesize of output 43 [2021-11-25 19:16:32,005 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:32,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 69 [2021-11-25 19:16:32,172 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-25 19:16:32,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:32,173 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:32,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946684561] [2021-11-25 19:16:32,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946684561] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:32,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:32,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:32,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152654038] [2021-11-25 19:16:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:32,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:32,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:32,176 INFO L87 Difference]: Start difference. First operand 330 states and 654 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:32,378 INFO L93 Difference]: Finished difference Result 449 states and 888 transitions. [2021-11-25 19:16:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:32,379 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-25 19:16:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:32,384 INFO L225 Difference]: With dead ends: 449 [2021-11-25 19:16:32,384 INFO L226 Difference]: Without dead ends: 449 [2021-11-25 19:16:32,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:32,389 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:32,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 15 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 210 Unchecked, 0.2s Time] [2021-11-25 19:16:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-25 19:16:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 397. [2021-11-25 19:16:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 389 states have (on average 2.025706940874036) internal successors, (788), 396 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 788 transitions. [2021-11-25 19:16:32,424 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 788 transitions. Word has length 15 [2021-11-25 19:16:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:32,425 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 788 transitions. [2021-11-25 19:16:32,425 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-25 19:16:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 788 transitions. [2021-11-25 19:16:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 19:16:32,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:32,427 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:32,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:32,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:32,643 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1418677501, now seen corresponding path program 1 times [2021-11-25 19:16:32,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:32,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939758724] [2021-11-25 19:16:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:32,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:32,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:32,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-25 19:16:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:32,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:16:32,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:32,833 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-25 19:16:32,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:32,983 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-25 19:16:32,983 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:32,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939758724] [2021-11-25 19:16:32,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939758724] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:32,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [882623704] [2021-11-25 19:16:32,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:32,984 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:16:32,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:16:32,990 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:16:33,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-25 19:16:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:33,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:16:33,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:33,215 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-25 19:16:33,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:33,294 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-25 19:16:33,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [882623704] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:33,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939784257] [2021-11-25 19:16:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:33,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:33,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:16:33,298 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:16:33,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:16:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:33,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:16:33,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:33,454 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-25 19:16:33,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:33,500 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-25 19:16:33,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939784257] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:33,500 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-25 19:16:33,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 11 [2021-11-25 19:16:33,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037724089] [2021-11-25 19:16:33,501 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-25 19:16:33,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 19:16:33,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:33,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 19:16:33,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-25 19:16:33,504 INFO L87 Difference]: Start difference. First operand 397 states and 788 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:33,985 INFO L93 Difference]: Finished difference Result 403 states and 794 transitions. [2021-11-25 19:16:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 19:16:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 19:16:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:33,991 INFO L225 Difference]: With dead ends: 403 [2021-11-25 19:16:33,991 INFO L226 Difference]: Without dead ends: 403 [2021-11-25 19:16:33,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2021-11-25 19:16:33,993 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:33,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:16:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-25 19:16:34,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2021-11-25 19:16:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 395 states have (on average 2.010126582278481) internal successors, (794), 402 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 794 transitions. [2021-11-25 19:16:34,029 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 794 transitions. Word has length 15 [2021-11-25 19:16:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:34,029 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 794 transitions. [2021-11-25 19:16:34,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 794 transitions. [2021-11-25 19:16:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 19:16:34,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:34,039 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:34,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:34,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:34,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:34,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt [2021-11-25 19:16:34,641 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1974779555, now seen corresponding path program 2 times [2021-11-25 19:16:34,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:34,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496595552] [2021-11-25 19:16:34,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:34,643 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:34,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:34,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-25 19:16:34,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:34,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:34,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:34,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:34,825 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-25 19:16:34,859 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:34,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-25 19:16:34,937 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:34,938 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 34 treesize of output 42 [2021-11-25 19:16:35,104 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:35,105 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 51 treesize of output 65 [2021-11-25 19:16:35,261 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-25 19:16:35,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:35,262 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:35,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496595552] [2021-11-25 19:16:35,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496595552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:35,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:35,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:35,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479005174] [2021-11-25 19:16:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:35,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:35,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:35,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:35,264 INFO L87 Difference]: Start difference. First operand 403 states and 794 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:35,707 INFO L93 Difference]: Finished difference Result 519 states and 1023 transitions. [2021-11-25 19:16:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:35,709 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-25 19:16:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:35,714 INFO L225 Difference]: With dead ends: 519 [2021-11-25 19:16:35,714 INFO L226 Difference]: Without dead ends: 519 [2021-11-25 19:16:35,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:35,716 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:35,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 53 Unchecked, 0.4s Time] [2021-11-25 19:16:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-11-25 19:16:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 471. [2021-11-25 19:16:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 463 states have (on average 2.0086393088552916) internal successors, (930), 470 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 930 transitions. [2021-11-25 19:16:35,741 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 930 transitions. Word has length 21 [2021-11-25 19:16:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:35,742 INFO L470 AbstractCegarLoop]: Abstraction has 471 states and 930 transitions. [2021-11-25 19:16:35,742 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-25 19:16:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 930 transitions. [2021-11-25 19:16:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:16:35,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:35,744 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:35,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:35,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:35,961 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 250522384, now seen corresponding path program 1 times [2021-11-25 19:16:35,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:35,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302953288] [2021-11-25 19:16:35,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:35,963 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:35,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:35,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:35,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-25 19:16:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:36,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:36,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:36,169 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-25 19:16:36,206 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:36,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 19:16:36,282 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:36,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2021-11-25 19:16:36,403 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:36,404 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 49 treesize of output 63 [2021-11-25 19:16:36,493 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-25 19:16:36,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:36,494 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302953288] [2021-11-25 19:16:36,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302953288] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:36,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:36,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:36,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471484699] [2021-11-25 19:16:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:36,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:36,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:36,497 INFO L87 Difference]: Start difference. First operand 471 states and 930 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:37,322 INFO L93 Difference]: Finished difference Result 550 states and 1085 transitions. [2021-11-25 19:16:37,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:37,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 19:16:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:37,329 INFO L225 Difference]: With dead ends: 550 [2021-11-25 19:16:37,329 INFO L226 Difference]: Without dead ends: 550 [2021-11-25 19:16:37,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:37,331 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:37,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 16 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 19:16:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-25 19:16:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 473. [2021-11-25 19:16:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 465 states have (on average 2.0086021505376346) internal successors, (934), 472 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 934 transitions. [2021-11-25 19:16:37,354 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 934 transitions. Word has length 22 [2021-11-25 19:16:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:37,355 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 934 transitions. [2021-11-25 19:16:37,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 934 transitions. [2021-11-25 19:16:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 19:16:37,357 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:37,357 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:37,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:37,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:37,570 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:37,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1088626462, now seen corresponding path program 1 times [2021-11-25 19:16:37,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:37,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445840116] [2021-11-25 19:16:37,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:37,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:37,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:37,572 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:37,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-25 19:16:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:37,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:37,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:37,786 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-25 19:16:37,820 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:37,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2021-11-25 19:16:37,923 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:37,923 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 36 treesize of output 44 [2021-11-25 19:16:38,092 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:38,093 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 54 treesize of output 68 [2021-11-25 19:16:38,361 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-25 19:16:38,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:38,361 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:38,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445840116] [2021-11-25 19:16:38,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445840116] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:38,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:38,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:38,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357492933] [2021-11-25 19:16:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:38,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:38,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:38,364 INFO L87 Difference]: Start difference. First operand 473 states and 934 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:38,493 INFO L93 Difference]: Finished difference Result 555 states and 1090 transitions. [2021-11-25 19:16:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:38,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 19:16:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:38,500 INFO L225 Difference]: With dead ends: 555 [2021-11-25 19:16:38,500 INFO L226 Difference]: Without dead ends: 555 [2021-11-25 19:16:38,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:38,502 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:38,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 17 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 302 Unchecked, 0.1s Time] [2021-11-25 19:16:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-25 19:16:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 497. [2021-11-25 19:16:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 489 states have (on average 2.0245398773006134) internal successors, (990), 496 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 990 transitions. [2021-11-25 19:16:38,526 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 990 transitions. Word has length 22 [2021-11-25 19:16:38,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:38,527 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 990 transitions. [2021-11-25 19:16:38,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 990 transitions. [2021-11-25 19:16:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 19:16:38,528 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:38,528 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:38,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:38,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:38,746 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -546842188, now seen corresponding path program 1 times [2021-11-25 19:16:38,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:38,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994743058] [2021-11-25 19:16:38,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:38,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:38,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:38,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:38,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-25 19:16:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:38,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 19:16:38,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:38,971 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-25 19:16:39,094 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-25 19:16:39,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:39,095 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:39,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994743058] [2021-11-25 19:16:39,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994743058] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:39,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:39,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:39,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613158330] [2021-11-25 19:16:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:39,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:39,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:39,099 INFO L87 Difference]: Start difference. First operand 497 states and 990 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:39,463 INFO L93 Difference]: Finished difference Result 1221 states and 2424 transitions. [2021-11-25 19:16:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:16:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 19:16:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:39,475 INFO L225 Difference]: With dead ends: 1221 [2021-11-25 19:16:39,476 INFO L226 Difference]: Without dead ends: 1221 [2021-11-25 19:16:39,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:16:39,477 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 86 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:39,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 144 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:16:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2021-11-25 19:16:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 541. [2021-11-25 19:16:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 532 states have (on average 2.0018796992481205) internal successors, (1065), 540 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1065 transitions. [2021-11-25 19:16:39,509 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1065 transitions. Word has length 23 [2021-11-25 19:16:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:39,510 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 1065 transitions. [2021-11-25 19:16:39,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1065 transitions. [2021-11-25 19:16:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:16:39,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:39,511 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:39,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-25 19:16:39,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:39,726 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 30683580, now seen corresponding path program 1 times [2021-11-25 19:16:39,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:39,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432448796] [2021-11-25 19:16:39,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:39,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:39,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:39,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-25 19:16:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:39,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 19:16:39,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:39,961 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-25 19:16:40,041 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-25 19:16:40,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:40,041 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432448796] [2021-11-25 19:16:40,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432448796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:40,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:40,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:40,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507827555] [2021-11-25 19:16:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:40,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:40,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:40,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:40,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:40,047 INFO L87 Difference]: Start difference. First operand 541 states and 1065 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:42,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-25 19:16:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:42,365 INFO L93 Difference]: Finished difference Result 1610 states and 3193 transitions. [2021-11-25 19:16:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:42,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 19:16:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:42,382 INFO L225 Difference]: With dead ends: 1610 [2021-11-25 19:16:42,382 INFO L226 Difference]: Without dead ends: 1610 [2021-11-25 19:16:42,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:42,385 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 116 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:42,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:16:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2021-11-25 19:16:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 563. [2021-11-25 19:16:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 554 states have (on average 2.003610108303249) internal successors, (1110), 562 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1110 transitions. [2021-11-25 19:16:42,424 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1110 transitions. Word has length 24 [2021-11-25 19:16:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:42,425 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 1110 transitions. [2021-11-25 19:16:42,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1110 transitions. [2021-11-25 19:16:42,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 19:16:42,427 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:42,427 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:42,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:42,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:42,640 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -475662686, now seen corresponding path program 2 times [2021-11-25 19:16:42,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514634816] [2021-11-25 19:16:42,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:42,642 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:42,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:42,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:42,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-25 19:16:42,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:42,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:42,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 19:16:42,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:42,875 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-25 19:16:42,954 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-25 19:16:42,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:42,955 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514634816] [2021-11-25 19:16:42,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514634816] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:42,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:42,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:42,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721342429] [2021-11-25 19:16:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:42,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:42,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:42,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:42,957 INFO L87 Difference]: Start difference. First operand 563 states and 1110 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:45,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-25 19:16:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:45,284 INFO L93 Difference]: Finished difference Result 1246 states and 2451 transitions. [2021-11-25 19:16:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:16:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 19:16:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:45,296 INFO L225 Difference]: With dead ends: 1246 [2021-11-25 19:16:45,296 INFO L226 Difference]: Without dead ends: 1246 [2021-11-25 19:16:45,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:45,298 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 88 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:45,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 136 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-25 19:16:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-11-25 19:16:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 562. [2021-11-25 19:16:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 553 states have (on average 2.003616636528029) internal successors, (1108), 561 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1108 transitions. [2021-11-25 19:16:45,329 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1108 transitions. Word has length 24 [2021-11-25 19:16:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:45,330 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1108 transitions. [2021-11-25 19:16:45,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1108 transitions. [2021-11-25 19:16:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:16:45,334 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:45,334 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:45,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:45,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:45,550 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:45,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash 264182771, now seen corresponding path program 1 times [2021-11-25 19:16:45,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851786652] [2021-11-25 19:16:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:45,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:45,553 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:45,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-25 19:16:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:45,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 19:16:45,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:45,773 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-25 19:16:45,854 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-25 19:16:45,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:45,854 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:45,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851786652] [2021-11-25 19:16:45,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851786652] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:45,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:45,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:45,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495336434] [2021-11-25 19:16:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:45,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:45,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:45,858 INFO L87 Difference]: Start difference. First operand 562 states and 1108 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:46,232 INFO L93 Difference]: Finished difference Result 1309 states and 2591 transitions. [2021-11-25 19:16:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:16:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:16:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:46,244 INFO L225 Difference]: With dead ends: 1309 [2021-11-25 19:16:46,244 INFO L226 Difference]: Without dead ends: 1309 [2021-11-25 19:16:46,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:16:46,246 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 90 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:46,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 144 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:16:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-11-25 19:16:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 590. [2021-11-25 19:16:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 580 states have (on average 1.9827586206896552) internal successors, (1150), 589 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1150 transitions. [2021-11-25 19:16:46,278 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1150 transitions. Word has length 25 [2021-11-25 19:16:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:46,279 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 1150 transitions. [2021-11-25 19:16:46,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1150 transitions. [2021-11-25 19:16:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:16:46,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:46,280 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:46,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:46,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:46,494 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:46,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2013276789, now seen corresponding path program 2 times [2021-11-25 19:16:46,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:46,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346926833] [2021-11-25 19:16:46,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:46,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:46,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:46,497 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:46,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-25 19:16:46,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:46,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:46,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 19:16:46,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:46,704 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-25 19:16:46,763 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-25 19:16:46,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:46,764 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:46,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346926833] [2021-11-25 19:16:46,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346926833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:46,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:46,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:46,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093542185] [2021-11-25 19:16:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:46,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:46,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:46,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:46,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:46,767 INFO L87 Difference]: Start difference. First operand 590 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:47,078 INFO L93 Difference]: Finished difference Result 1024 states and 1993 transitions. [2021-11-25 19:16:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:16:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:16:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:47,087 INFO L225 Difference]: With dead ends: 1024 [2021-11-25 19:16:47,087 INFO L226 Difference]: Without dead ends: 1024 [2021-11-25 19:16:47,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:47,088 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 100 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:47,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 125 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:16:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-25 19:16:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 591. [2021-11-25 19:16:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 581 states have (on average 1.9827882960413081) internal successors, (1152), 590 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1152 transitions. [2021-11-25 19:16:47,123 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1152 transitions. Word has length 25 [2021-11-25 19:16:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:47,125 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 1152 transitions. [2021-11-25 19:16:47,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1152 transitions. [2021-11-25 19:16:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 19:16:47,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:47,128 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:47,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:47,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:47,342 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -530141851, now seen corresponding path program 3 times [2021-11-25 19:16:47,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:47,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979412793] [2021-11-25 19:16:47,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:16:47,344 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:47,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:47,345 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:47,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-25 19:16:47,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:16:47,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:47,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-25 19:16:47,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:47,543 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-25 19:16:47,602 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-25 19:16:47,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:47,602 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979412793] [2021-11-25 19:16:47,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979412793] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:47,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:47,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:47,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946420258] [2021-11-25 19:16:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:47,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:16:47,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:16:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:16:47,606 INFO L87 Difference]: Start difference. First operand 591 states and 1152 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:47,898 INFO L93 Difference]: Finished difference Result 1295 states and 2535 transitions. [2021-11-25 19:16:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:47,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-25 19:16:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:47,909 INFO L225 Difference]: With dead ends: 1295 [2021-11-25 19:16:47,909 INFO L226 Difference]: Without dead ends: 1295 [2021-11-25 19:16:47,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:47,910 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 117 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:47,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 117 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:16:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2021-11-25 19:16:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 590. [2021-11-25 19:16:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 580 states have (on average 1.9827586206896552) internal successors, (1150), 589 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1150 transitions. [2021-11-25 19:16:47,941 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1150 transitions. Word has length 25 [2021-11-25 19:16:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:47,941 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 1150 transitions. [2021-11-25 19:16:47,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1150 transitions. [2021-11-25 19:16:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:16:47,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:47,943 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-25 19:16:47,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:48,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:48,168 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -777487903, now seen corresponding path program 1 times [2021-11-25 19:16:48,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107714918] [2021-11-25 19:16:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:48,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:48,170 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:48,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-25 19:16:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:48,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:48,420 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-25 19:16:48,453 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:48,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 19:16:48,529 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:48,530 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 45 treesize of output 53 [2021-11-25 19:16:48,657 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:48,658 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 65 treesize of output 79 [2021-11-25 19:16:48,744 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-25 19:16:48,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:48,744 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107714918] [2021-11-25 19:16:48,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107714918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:48,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:48,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:48,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94900131] [2021-11-25 19:16:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:48,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:48,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:48,747 INFO L87 Difference]: Start difference. First operand 590 states and 1150 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-25 19:16:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:49,300 INFO L93 Difference]: Finished difference Result 653 states and 1277 transitions. [2021-11-25 19:16:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:49,301 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-25 19:16:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:49,306 INFO L225 Difference]: With dead ends: 653 [2021-11-25 19:16:49,307 INFO L226 Difference]: Without dead ends: 638 [2021-11-25 19:16:49,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:49,308 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:49,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 46 Unchecked, 0.5s Time] [2021-11-25 19:16:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-11-25 19:16:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 624. [2021-11-25 19:16:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 615 states have (on average 1.975609756097561) internal successors, (1215), 623 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1215 transitions. [2021-11-25 19:16:49,332 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1215 transitions. Word has length 27 [2021-11-25 19:16:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:49,332 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 1215 transitions. [2021-11-25 19:16:49,332 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-25 19:16:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1215 transitions. [2021-11-25 19:16:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 19:16:49,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:49,333 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-25 19:16:49,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-25 19:16:49,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:49,550 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2022847337, now seen corresponding path program 1 times [2021-11-25 19:16:49,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695417270] [2021-11-25 19:16:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:49,553 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:49,554 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:49,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-25 19:16:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:49,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:49,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:49,793 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 12 treesize of output 8 [2021-11-25 19:16:49,817 INFO L354 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2021-11-25 19:16:49,818 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 26 treesize of output 28 [2021-11-25 19:16:49,934 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-25 19:16:49,935 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 40 treesize of output 48 [2021-11-25 19:16:50,120 INFO L354 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2021-11-25 19:16:50,121 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 58 treesize of output 72 [2021-11-25 19:16:50,295 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-25 19:16:50,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:50,296 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:50,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695417270] [2021-11-25 19:16:50,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695417270] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:50,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:50,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:50,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648380000] [2021-11-25 19:16:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:50,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:50,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:50,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:50,298 INFO L87 Difference]: Start difference. First operand 624 states and 1215 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-25 19:16:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:50,493 INFO L93 Difference]: Finished difference Result 736 states and 1425 transitions. [2021-11-25 19:16:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:50,494 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-25 19:16:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:50,500 INFO L225 Difference]: With dead ends: 736 [2021-11-25 19:16:50,500 INFO L226 Difference]: Without dead ends: 721 [2021-11-25 19:16:50,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:50,502 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:50,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2021-11-25 19:16:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-11-25 19:16:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 679. [2021-11-25 19:16:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 670 states have (on average 1.971641791044776) internal successors, (1321), 678 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1321 transitions. [2021-11-25 19:16:50,529 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1321 transitions. Word has length 27 [2021-11-25 19:16:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:50,529 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 1321 transitions. [2021-11-25 19:16:50,530 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-25 19:16:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1321 transitions. [2021-11-25 19:16:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 19:16:50,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:50,531 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:50,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:50,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:50,748 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1714395672, now seen corresponding path program 1 times [2021-11-25 19:16:50,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:50,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577299613] [2021-11-25 19:16:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:50,749 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:50,750 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:50,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-25 19:16:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:50,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:50,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:50,979 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 12 treesize of output 8 [2021-11-25 19:16:51,005 INFO L354 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2021-11-25 19:16:51,006 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 28 treesize of output 30 [2021-11-25 19:16:51,111 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-25 19:16:51,111 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 38 treesize of output 46 [2021-11-25 19:16:51,295 INFO L354 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2021-11-25 19:16:51,296 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 55 treesize of output 69 [2021-11-25 19:16:51,426 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-25 19:16:51,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:51,426 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577299613] [2021-11-25 19:16:51,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577299613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:51,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:51,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:51,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033720405] [2021-11-25 19:16:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:51,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:51,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:51,429 INFO L87 Difference]: Start difference. First operand 679 states and 1321 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:51,623 INFO L93 Difference]: Finished difference Result 735 states and 1423 transitions. [2021-11-25 19:16:51,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:51,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 19:16:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:51,630 INFO L225 Difference]: With dead ends: 735 [2021-11-25 19:16:51,631 INFO L226 Difference]: Without dead ends: 735 [2021-11-25 19:16:51,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:51,632 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:51,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2021-11-25 19:16:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-11-25 19:16:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 677. [2021-11-25 19:16:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 668 states have (on average 1.973053892215569) internal successors, (1318), 676 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1318 transitions. [2021-11-25 19:16:51,665 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1318 transitions. Word has length 28 [2021-11-25 19:16:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:51,667 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 1318 transitions. [2021-11-25 19:16:51,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1318 transitions. [2021-11-25 19:16:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 19:16:51,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:51,669 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:51,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:51,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:51,882 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1716183132, now seen corresponding path program 2 times [2021-11-25 19:16:51,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069942831] [2021-11-25 19:16:51,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:51,884 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:51,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:51,885 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:51,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-25 19:16:52,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:52,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:52,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:52,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:52,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-11-25 19:16:52,099 INFO L354 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2021-11-25 19:16:52,100 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 26 treesize of output 28 [2021-11-25 19:16:52,187 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-25 19:16:52,188 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 38 treesize of output 46 [2021-11-25 19:16:52,385 INFO L354 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2021-11-25 19:16:52,386 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 55 treesize of output 69 [2021-11-25 19:16:52,513 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-25 19:16:52,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:52,513 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:52,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069942831] [2021-11-25 19:16:52,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069942831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:52,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:52,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:52,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029968010] [2021-11-25 19:16:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:52,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:52,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:52,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:52,516 INFO L87 Difference]: Start difference. First operand 677 states and 1318 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:52,681 INFO L93 Difference]: Finished difference Result 725 states and 1413 transitions. [2021-11-25 19:16:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 19:16:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:52,687 INFO L225 Difference]: With dead ends: 725 [2021-11-25 19:16:52,688 INFO L226 Difference]: Without dead ends: 725 [2021-11-25 19:16:52,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:52,690 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:52,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-11-25 19:16:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-11-25 19:16:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 675. [2021-11-25 19:16:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 666 states have (on average 1.9744744744744744) internal successors, (1315), 674 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1315 transitions. [2021-11-25 19:16:52,717 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1315 transitions. Word has length 28 [2021-11-25 19:16:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:52,717 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 1315 transitions. [2021-11-25 19:16:52,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1315 transitions. [2021-11-25 19:16:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 19:16:52,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:52,719 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:52,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:52,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:52,934 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1716239862, now seen corresponding path program 3 times [2021-11-25 19:16:52,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:52,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727128426] [2021-11-25 19:16:52,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:16:52,936 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:52,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:52,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:52,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-25 19:16:53,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:16:53,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:53,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:53,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:53,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-11-25 19:16:53,207 INFO L354 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2021-11-25 19:16:53,208 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 26 treesize of output 28 [2021-11-25 19:16:53,303 INFO L354 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2021-11-25 19:16:53,303 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 42 treesize of output 50 [2021-11-25 19:16:53,481 INFO L354 Elim1Store]: treesize reduction 98, result has 26.3 percent of original size [2021-11-25 19:16:53,481 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 60 treesize of output 74 [2021-11-25 19:16:53,754 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-25 19:16:53,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:53,755 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:53,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727128426] [2021-11-25 19:16:53,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727128426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:53,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:53,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:53,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056765834] [2021-11-25 19:16:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:53,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:53,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:53,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:53,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:53,757 INFO L87 Difference]: Start difference. First operand 675 states and 1315 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:53,921 INFO L93 Difference]: Finished difference Result 701 states and 1363 transitions. [2021-11-25 19:16:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:53,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 19:16:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:53,926 INFO L225 Difference]: With dead ends: 701 [2021-11-25 19:16:53,926 INFO L226 Difference]: Without dead ends: 701 [2021-11-25 19:16:53,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:53,927 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:53,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 16 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2021-11-25 19:16:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-11-25 19:16:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 671. [2021-11-25 19:16:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 663 states have (on average 1.9743589743589745) internal successors, (1309), 670 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1309 transitions. [2021-11-25 19:16:53,952 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1309 transitions. Word has length 28 [2021-11-25 19:16:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:53,952 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 1309 transitions. [2021-11-25 19:16:53,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1309 transitions. [2021-11-25 19:16:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 19:16:53,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:53,954 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] [2021-11-25 19:16:53,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:54,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:54,171 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 526463411, now seen corresponding path program 1 times [2021-11-25 19:16:54,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:54,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105839996] [2021-11-25 19:16:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:54,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:54,174 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:54,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-25 19:16:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:54,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:54,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:54,424 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-25 19:16:54,477 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:54,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-25 19:16:54,550 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:54,551 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 31 treesize of output 39 [2021-11-25 19:16:54,669 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:54,669 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 46 treesize of output 60 [2021-11-25 19:16:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:16:54,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:54,832 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:54,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105839996] [2021-11-25 19:16:54,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105839996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:54,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:54,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:54,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090625470] [2021-11-25 19:16:54,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:54,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:54,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:54,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:54,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:54,834 INFO L87 Difference]: Start difference. First operand 671 states and 1309 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:55,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:55,129 INFO L93 Difference]: Finished difference Result 737 states and 1435 transitions. [2021-11-25 19:16:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 19:16:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:55,134 INFO L225 Difference]: With dead ends: 737 [2021-11-25 19:16:55,134 INFO L226 Difference]: Without dead ends: 737 [2021-11-25 19:16:55,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:55,135 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:55,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 108 Unchecked, 0.3s Time] [2021-11-25 19:16:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-11-25 19:16:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 671. [2021-11-25 19:16:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 663 states have (on average 1.9743589743589745) internal successors, (1309), 670 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1309 transitions. [2021-11-25 19:16:55,158 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1309 transitions. Word has length 37 [2021-11-25 19:16:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:55,158 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 1309 transitions. [2021-11-25 19:16:55,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1309 transitions. [2021-11-25 19:16:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-25 19:16:55,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:55,160 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] [2021-11-25 19:16:55,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:55,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:55,374 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash 526544321, now seen corresponding path program 2 times [2021-11-25 19:16:55,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:55,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201967874] [2021-11-25 19:16:55,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:55,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:55,377 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:55,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-11-25 19:16:55,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:55,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:55,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:55,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:55,573 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-25 19:16:55,600 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:55,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2021-11-25 19:16:55,680 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:55,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2021-11-25 19:16:55,889 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:55,889 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 55 treesize of output 69 [2021-11-25 19:16:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:16:55,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:55,997 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:55,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201967874] [2021-11-25 19:16:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201967874] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:55,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:55,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:55,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418721179] [2021-11-25 19:16:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:55,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:55,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:55,999 INFO L87 Difference]: Start difference. First operand 671 states and 1309 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:56,225 INFO L93 Difference]: Finished difference Result 719 states and 1414 transitions. [2021-11-25 19:16:56,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-25 19:16:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:56,230 INFO L225 Difference]: With dead ends: 719 [2021-11-25 19:16:56,230 INFO L226 Difference]: Without dead ends: 717 [2021-11-25 19:16:56,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:56,231 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:56,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 113 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2021-11-25 19:16:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-25 19:16:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 673. [2021-11-25 19:16:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 665 states have (on average 1.974436090225564) internal successors, (1313), 672 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1313 transitions. [2021-11-25 19:16:56,253 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1313 transitions. Word has length 37 [2021-11-25 19:16:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:56,253 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 1313 transitions. [2021-11-25 19:16:56,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1313 transitions. [2021-11-25 19:16:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 19:16:56,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:56,255 INFO L514 BasicCegarLoop]: trace histogram [10, 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] [2021-11-25 19:16:56,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-11-25 19:16:56,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:56,470 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash -998992688, now seen corresponding path program 1 times [2021-11-25 19:16:56,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:56,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645552833] [2021-11-25 19:16:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:56,472 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:56,473 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:56,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-11-25 19:16:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:56,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:56,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:56,746 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-25 19:16:56,770 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:56,770 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 22 treesize of output 24 [2021-11-25 19:16:56,856 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:56,857 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 37 treesize of output 45 [2021-11-25 19:16:56,990 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:56,991 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 47 treesize of output 61 [2021-11-25 19:16:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-25 19:16:57,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:57,205 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645552833] [2021-11-25 19:16:57,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645552833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:57,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:57,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:57,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647186928] [2021-11-25 19:16:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:57,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:57,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:57,207 INFO L87 Difference]: Start difference. First operand 673 states and 1313 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:57,373 INFO L93 Difference]: Finished difference Result 761 states and 1497 transitions. [2021-11-25 19:16:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 38 [2021-11-25 19:16:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:57,378 INFO L225 Difference]: With dead ends: 761 [2021-11-25 19:16:57,378 INFO L226 Difference]: Without dead ends: 761 [2021-11-25 19:16:57,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:57,380 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:57,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 15 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2021-11-25 19:16:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2021-11-25 19:16:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 671. [2021-11-25 19:16:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 663 states have (on average 1.9743589743589745) internal successors, (1309), 670 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1309 transitions. [2021-11-25 19:16:57,403 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1309 transitions. Word has length 38 [2021-11-25 19:16:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:57,404 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 1309 transitions. [2021-11-25 19:16:57,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1309 transitions. [2021-11-25 19:16:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 19:16:57,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:57,405 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] [2021-11-25 19:16:57,427 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:57,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:57,623 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -859502127, now seen corresponding path program 1 times [2021-11-25 19:16:57,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:57,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298850973] [2021-11-25 19:16:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:57,624 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:57,625 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:57,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-11-25 19:16:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:57,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:57,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:57,904 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-25 19:16:57,940 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:57,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 19:16:58,028 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:58,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2021-11-25 19:16:58,204 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:58,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 64 [2021-11-25 19:16:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:16:58,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:58,576 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:58,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298850973] [2021-11-25 19:16:58,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298850973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:58,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:58,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:58,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634048570] [2021-11-25 19:16:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:58,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:58,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:58,578 INFO L87 Difference]: Start difference. First operand 671 states and 1309 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:58,720 INFO L93 Difference]: Finished difference Result 773 states and 1505 transitions. [2021-11-25 19:16:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 38 [2021-11-25 19:16:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:58,726 INFO L225 Difference]: With dead ends: 773 [2021-11-25 19:16:58,726 INFO L226 Difference]: Without dead ends: 773 [2021-11-25 19:16:58,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:58,727 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:58,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2021-11-25 19:16:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2021-11-25 19:16:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 670. [2021-11-25 19:16:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 662 states have (on average 1.9743202416918428) internal successors, (1307), 669 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1307 transitions. [2021-11-25 19:16:58,748 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1307 transitions. Word has length 38 [2021-11-25 19:16:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:58,748 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1307 transitions. [2021-11-25 19:16:58,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1307 transitions. [2021-11-25 19:16:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-25 19:16:58,750 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:58,750 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] [2021-11-25 19:16:58,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:58,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:16:58,966 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:16:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash -856993917, now seen corresponding path program 2 times [2021-11-25 19:16:58,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:16:58,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707007574] [2021-11-25 19:16:58,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:16:58,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:16:58,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:16:58,969 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:16:59,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-11-25 19:16:59,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:16:59,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:16:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 19:16:59,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:59,240 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-25 19:16:59,267 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:16:59,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-11-25 19:16:59,358 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:16:59,358 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 36 treesize of output 44 [2021-11-25 19:16:59,527 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:16:59,527 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 52 treesize of output 66 [2021-11-25 19:16:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:16:59,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:16:59,710 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:16:59,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707007574] [2021-11-25 19:16:59,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707007574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:16:59,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:16:59,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:16:59,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262939201] [2021-11-25 19:16:59,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:16:59,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:16:59,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:16:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:16:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:59,712 INFO L87 Difference]: Start difference. First operand 670 states and 1307 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:59,857 INFO L93 Difference]: Finished difference Result 785 states and 1525 transitions. [2021-11-25 19:16:59,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 19:16:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 38 [2021-11-25 19:16:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:59,862 INFO L225 Difference]: With dead ends: 785 [2021-11-25 19:16:59,862 INFO L226 Difference]: Without dead ends: 784 [2021-11-25 19:16:59,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:16:59,863 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:59,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 15 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2021-11-25 19:16:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-11-25 19:16:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 666. [2021-11-25 19:16:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 658 states have (on average 1.9741641337386018) internal successors, (1299), 665 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1299 transitions. [2021-11-25 19:16:59,885 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1299 transitions. Word has length 38 [2021-11-25 19:16:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:59,885 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 1299 transitions. [2021-11-25 19:16:59,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1299 transitions. [2021-11-25 19:16:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-25 19:16:59,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:59,887 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] [2021-11-25 19:16:59,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-11-25 19:17:00,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 [2021-11-25 19:17:00,102 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:17:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:17:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1591010465, now seen corresponding path program 2 times [2021-11-25 19:17:00,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:17:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700676154] [2021-11-25 19:17:00,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:17:00,104 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:17:00,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:17:00,104 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:17:00,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-11-25 19:17:00,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:17:00,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:17:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-25 19:17:00,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:17:00,582 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-25 19:17:00,668 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:17:00,668 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 25 treesize of output 27 [2021-11-25 19:17:00,836 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:17:00,837 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 42 treesize of output 50 [2021-11-25 19:17:01,088 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:17:01,089 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 55 treesize of output 69 [2021-11-25 19:17:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:01,479 INFO L354 Elim1Store]: treesize reduction 102, result has 31.5 percent of original size [2021-11-25 19:17:01,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 86 [2021-11-25 19:17:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:17:01,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:17:03,308 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:17:03,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700676154] [2021-11-25 19:17:03,309 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:17:03,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1764808554] [2021-11-25 19:17:03,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:17:03,310 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:17:03,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:17:03,312 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:17:03,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-11-25 19:17:03,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:17:03,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:17:03,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-25 19:17:03,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:17:03,892 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-25 19:17:04,239 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:17:04,239 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 22 treesize of output 14 [2021-11-25 19:17:04,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:17:04,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:04,605 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 24 treesize of output 23 [2021-11-25 19:17:04,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:04,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:04,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:04,792 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 35 treesize of output 37 [2021-11-25 19:17:05,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,092 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 48 treesize of output 53 [2021-11-25 19:17:05,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:05,497 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 63 treesize of output 71 [2021-11-25 19:17:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:17:05,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:17:08,516 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:17:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954789751] [2021-11-25 19:17:08,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-25 19:17:08,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:17:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:17:08,521 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:17:08,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-11-25 19:17:08,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-25 19:17:08,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:17:08,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-25 19:17:08,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:17:08,930 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-25 19:17:09,035 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 19:17:09,035 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 27 treesize of output 29 [2021-11-25 19:17:09,254 INFO L354 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2021-11-25 19:17:09,255 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 37 treesize of output 45 [2021-11-25 19:17:09,558 INFO L354 Elim1Store]: treesize reduction 95, result has 26.9 percent of original size [2021-11-25 19:17:09,559 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 55 treesize of output 69 [2021-11-25 19:17:18,092 WARN L227 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 69 DAG size of output: 22 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-25 19:17:18,093 INFO L354 Elim1Store]: treesize reduction 136, result has 25.7 percent of original size [2021-11-25 19:17:18,093 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 77 treesize of output 97 [2021-11-25 19:17:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:17:18,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:17:18,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954789751] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:17:18,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:17:18,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 19:17:18,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858315733] [2021-11-25 19:17:18,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:17:18,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 19:17:18,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-25 19:17:18,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 19:17:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:17:18,243 INFO L87 Difference]: Start difference. First operand 666 states and 1299 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:17:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:17:18,920 INFO L93 Difference]: Finished difference Result 1366 states and 2703 transitions. [2021-11-25 19:17:18,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 19:17:18,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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 39 [2021-11-25 19:17:18,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:17:18,929 INFO L225 Difference]: With dead ends: 1366 [2021-11-25 19:17:18,929 INFO L226 Difference]: Without dead ends: 1366 [2021-11-25 19:17:18,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=271, Invalid=1211, Unknown=0, NotChecked=0, Total=1482 [2021-11-25 19:17:18,930 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:17:18,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 24 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 275 Invalid, 0 Unknown, 216 Unchecked, 0.5s Time] [2021-11-25 19:17:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-11-25 19:17:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 972. [2021-11-25 19:17:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 964 states have (on average 2.069502074688797) internal successors, (1995), 971 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:17:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1995 transitions. [2021-11-25 19:17:18,964 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1995 transitions. Word has length 39 [2021-11-25 19:17:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:17:18,965 INFO L470 AbstractCegarLoop]: Abstraction has 972 states and 1995 transitions. [2021-11-25 19:17:18,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:17:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1995 transitions. [2021-11-25 19:17:18,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-25 19:17:18,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:17:18,967 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] [2021-11-25 19:17:18,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-11-25 19:17:19,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2021-11-25 19:17:19,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-11-25 19:17:19,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:17:19,582 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-25 19:17:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:17:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1591068125, now seen corresponding path program 3 times [2021-11-25 19:17:19,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-25 19:17:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546872586] [2021-11-25 19:17:19,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:17:19,583 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-25 19:17:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat [2021-11-25 19:17:19,584 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-25 19:17:19,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-11-25 19:17:19,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-25 19:17:19,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:17:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-25 19:17:19,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:17:19,840 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-25 19:17:20,039 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-25 19:17:20,040 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 24 treesize of output 16 [2021-11-25 19:17:20,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:17:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,285 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 25 treesize of output 24 [2021-11-25 19:17:20,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,428 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 35 treesize of output 37 [2021-11-25 19:17:20,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,605 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:17:20,606 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 51 treesize of output 56 [2021-11-25 19:17:20,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:20,733 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:17:20,734 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 50 treesize of output 55 [2021-11-25 19:17:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-25 19:17:20,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:17:22,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:17:22,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:19:07,882 WARN L227 SmtUtils]: Spent 1.75m on a formula simplification. DAG size of input: 140 DAG size of output: 95 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-25 19:19:07,883 INFO L354 Elim1Store]: treesize reduction 331, result has 50.8 percent of original size [2021-11-25 19:19:07,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 185 treesize of output 395 [2021-11-25 19:19:07,921 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:19:07,921 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 395 treesize of output 385 [2021-11-25 19:19:07,973 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:19:07,973 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 385 treesize of output 377 [2021-11-25 19:19:08,005 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:19:08,005 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 377 treesize of output 367 [2021-11-25 19:19:08,020 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-25 19:19:08,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546872586] [2021-11-25 19:19:08,020 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-25 19:19:08,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1303446798] [2021-11-25 19:19:08,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:19:08,021 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-25 19:19:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 [2021-11-25 19:19:08,027 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-25 19:19:08,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-11-25 19:19:08,253 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@21af42c2 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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-25 19:19:08,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154566283] [2021-11-25 19:19:08,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:19:08,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:19:08,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:19:08,259 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:19:08,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-11-25 19:19:08,368 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@21af42c2 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:274) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.decoupleArrayValues(TransFormulaUtils.java:1226) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckUtils.decoupleArrayValues(TraceCheckUtils.java:388) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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-25 19:19:08,369 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:19:08,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-25 19:19:08,369 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-11-25 19:19:08,369 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-25 19:19:08,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2021-11-25 19:19:08,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2021-11-25 19:19:08,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2021-11-25 19:19:08,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 7 remaining) [2021-11-25 19:19:08,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2021-11-25 19:19:08,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2021-11-25 19:19:08,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2021-11-25 19:19:08,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-11-25 19:19:08,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2021-11-25 19:19:08,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2021-11-25 19:19:08,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/mathsat -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:19:08,980 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-25 19:19:08,984 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-25 19:19:08,984 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 19:19:09,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 07:19:09 BasicIcfg [2021-11-25 19:19:09,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 19:19:09,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 19:19:09,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 19:19:09,007 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 19:19:09,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:16:22" (3/4) ... [2021-11-25 19:19:09,010 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-25 19:19:09,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 19:19:09,011 INFO L158 Benchmark]: Toolchain (without parser) took 168235.85ms. Allocated memory was 65.0MB in the beginning and 151.0MB in the end (delta: 86.0MB). Free memory was 44.9MB in the beginning and 82.6MB in the end (delta: -37.7MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,012 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 45.6MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:19:09,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1051.63ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 30.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.78ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 27.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,013 INFO L158 Benchmark]: Boogie Preprocessor took 104.59ms. Allocated memory was 65.0MB in the beginning and 102.8MB in the end (delta: 37.7MB). Free memory was 27.6MB in the beginning and 84.8MB in the end (delta: -57.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,013 INFO L158 Benchmark]: RCFGBuilder took 680.80ms. Allocated memory is still 102.8MB. Free memory was 84.8MB in the beginning and 70.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,014 INFO L158 Benchmark]: TraceAbstraction took 166281.91ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 69.7MB in the beginning and 82.6MB in the end (delta: -12.9MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2021-11-25 19:19:09,014 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 151.0MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:19:09,016 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 65.0MB. Free memory was 45.6MB in the beginning and 45.6MB in the end (delta: 57.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1051.63ms. Allocated memory is still 65.0MB. Free memory was 44.7MB in the beginning and 30.4MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.78ms. Allocated memory is still 65.0MB. Free memory was 30.4MB in the beginning and 27.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.59ms. Allocated memory was 65.0MB in the beginning and 102.8MB in the end (delta: 37.7MB). Free memory was 27.6MB in the beginning and 84.8MB in the end (delta: -57.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * RCFGBuilder took 680.80ms. Allocated memory is still 102.8MB. Free memory was 84.8MB in the beginning and 70.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 166281.91ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 69.7MB in the beginning and 82.6MB in the end (delta: -12.9MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 151.0MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 105 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 41 TransitionsAfterwards, 3192 CoEnabledTransitionPairs, 5 FixpointIterations, 20 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 69 TotalNumberOfCompositions, 9060 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2854, positive: 2522, positive conditional: 0, positive unconditional: 2522, negative: 332, negative conditional: 0, negative unconditional: 332, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1834, positive: 1750, positive conditional: 0, positive unconditional: 1750, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1834, positive: 1697, positive conditional: 0, positive unconditional: 1697, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 137, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1367, positive: 434, positive conditional: 0, positive unconditional: 434, negative: 932, negative conditional: 0, negative unconditional: 932, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2854, positive: 772, positive conditional: 0, positive unconditional: 772, negative: 248, negative conditional: 0, negative unconditional: 248, unknown: 1834, unknown conditional: 0, unknown unconditional: 1834] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L917-L920] 0 struct cache_entry { int refs; pthread_mutex_t refs_mutex; } cache[10]; [L933] 0 int i = 0; [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L933] COND TRUE 0 i < 10 [L933] 0 i++ [L935] 0 int i; [L936] 0 pthread_t t1; [L937] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) [L938] 0 i=0 [L938] COND TRUE 0 i<10 [L939] CALL 0 cache_entry_addref(&cache[i]) [L923] EXPR 0 entry->refs [L923] 0 entry->refs++ [L939] RET 0 cache_entry_addref(&cache[i]) [L938] 0 i++ [L938] COND TRUE 0 i<10 [L939] CALL 0 cache_entry_addref(&cache[i]) [L923] 0 entry->refs [L927] 1 int i; [L928] 1 i=0 [L928] COND TRUE 1 i<10 [L929] CALL 1 cache_entry_addref(&cache[i]) [L923] EXPR 1 entry->refs [L923] 1 entry->refs++ - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 937]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 140 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 166.1s, OverallIterations: 25, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 957 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 1268 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1602 IncrementalHoareTripleChecker+Unchecked, 1695 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2778 IncrementalHoareTripleChecker+Invalid, 4500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 582 mSDtfsCounter, 2778 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 692 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=24, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 5512 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 130.2s InterpolantComputationTime, 761 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 806 ConstructedInterpolants, 69 QuantifiedInterpolants, 5892 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2794 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 36 InterpolantComputations, 22 PerfectInterpolantSequences, 1257/1325 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-25 19:19:09,244 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-25 19:19:09,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4e850e4-1994-4aad-a17f-19b6f23cd415/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN