./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 17:18:19,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 17:18:19,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 17:18:19,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 17:18:19,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 17:18:19,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 17:18:19,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 17:18:19,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 17:18:19,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 17:18:19,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 17:18:19,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 17:18:19,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 17:18:19,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 17:18:19,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 17:18:19,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 17:18:19,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 17:18:19,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 17:18:19,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 17:18:19,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 17:18:19,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 17:18:19,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 17:18:19,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 17:18:19,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 17:18:19,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 17:18:19,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 17:18:19,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 17:18:19,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 17:18:19,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 17:18:19,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 17:18:19,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 17:18:19,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 17:18:19,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 17:18:19,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 17:18:19,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 17:18:19,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 17:18:19,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 17:18:19,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 17:18:19,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 17:18:19,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 17:18:19,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 17:18:19,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 17:18:19,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 17:18:19,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-04-18 17:18:20,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 17:18:20,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 17:18:20,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 17:18:20,023 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 17:18:20,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 17:18:20,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 17:18:20,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 17:18:20,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 17:18:20,026 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 17:18:20,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 17:18:20,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 17:18:20,027 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 17:18:20,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 17:18:20,028 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 17:18:20,029 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 17:18:20,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 17:18:20,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 17:18:20,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 17:18:20,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 17:18:20,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 17:18:20,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-18 17:18:20,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 17:18:20,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:18:20,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 17:18:20,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 17:18:20,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-04-18 17:18:20,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 17:18:20,033 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-04-18 17:18:20,033 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-04-18 17:18:20,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 -> GemCutter 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2022-04-18 17:18:20,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 17:18:20,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 17:18:20,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 17:18:20,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 17:18:20,300 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 17:18:20,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2022-04-18 17:18:20,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be72161ce/e2345f8f069243e69f492d6296ebb6bc/FLAGf5da1fc85 [2022-04-18 17:18:20,810 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 17:18:20,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i [2022-04-18 17:18:20,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be72161ce/e2345f8f069243e69f492d6296ebb6bc/FLAGf5da1fc85 [2022-04-18 17:18:21,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/be72161ce/e2345f8f069243e69f492d6296ebb6bc [2022-04-18 17:18:21,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 17:18:21,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 17:18:21,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 17:18:21,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 17:18:21,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 17:18:21,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609cedbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21, skipping insertion in model container [2022-04-18 17:18:21,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 17:18:21,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 17:18:21,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30422,30435] [2022-04-18 17:18:21,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:18:21,444 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 17:18:21,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/09_fmaxsym.i[30422,30435] [2022-04-18 17:18:21,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 17:18:21,533 INFO L208 MainTranslator]: Completed translation [2022-04-18 17:18:21,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21 WrapperNode [2022-04-18 17:18:21,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 17:18:21,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 17:18:21,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 17:18:21,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 17:18:21,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,579 INFO L137 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2022-04-18 17:18:21,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 17:18:21,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 17:18:21,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 17:18:21,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 17:18:21,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 17:18:21,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 17:18:21,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 17:18:21,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 17:18:21,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (1/1) ... [2022-04-18 17:18:21,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 17:18:21,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:21,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:21,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 17:18:21,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 17:18:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-04-18 17:18:21,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-04-18 17:18:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 17:18:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 17:18:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 17:18:21,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 17:18:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 17:18:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 17:18:21,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 17:18:21,674 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 17:18:21,775 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 17:18:21,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 17:18:21,958 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 17:18:22,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 17:18:22,007 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-18 17:18:22,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:18:22 BoogieIcfgContainer [2022-04-18 17:18:22,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 17:18:22,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 17:18:22,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 17:18:22,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 17:18:22,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 05:18:21" (1/3) ... [2022-04-18 17:18:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a597f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:18:22, skipping insertion in model container [2022-04-18 17:18:22,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 05:18:21" (2/3) ... [2022-04-18 17:18:22,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a597f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 05:18:22, skipping insertion in model container [2022-04-18 17:18:22,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 05:18:22" (3/3) ... [2022-04-18 17:18:22,025 INFO L111 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2022-04-18 17:18:22,029 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 17:18:22,030 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 17:18:22,030 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-04-18 17:18:22,030 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 17:18:22,080 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:22,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-04-18 17:18:22,158 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2022-04-18 17:18:22,163 INFO L340 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=PARTIAL_ORDER_FA, 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 [2022-04-18 17:18:22,164 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-04-18 17:18:22,333 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1656393280, now seen corresponding path program 1 times [2022-04-18 17:18:22,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084000783] [2022-04-18 17:18:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 17:18:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:22,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084000783] [2022-04-18 17:18:22,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084000783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:22,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:22,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347182917] [2022-04-18 17:18:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:22,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,603 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:22,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:22,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,669 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 17:18:22,669 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:22,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1357033797, now seen corresponding path program 1 times [2022-04-18 17:18:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:22,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879514623] [2022-04-18 17:18:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:22,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879514623] [2022-04-18 17:18:22,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879514623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:22,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:22,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:22,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130530380] [2022-04-18 17:18:22,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:22,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:22,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:22,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,902 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:22,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:22,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:22,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 17:18:22,992 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1453050336, now seen corresponding path program 1 times [2022-04-18 17:18:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:22,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921714502] [2022-04-18 17:18:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:23,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921714502] [2022-04-18 17:18:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921714502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:23,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:23,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673610822] [2022-04-18 17:18:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:23,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,080 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:23,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:23,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:23,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:23,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 17:18:23,106 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash 119808038, now seen corresponding path program 1 times [2022-04-18 17:18:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:23,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565887987] [2022-04-18 17:18:23,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-18 17:18:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:23,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565887987] [2022-04-18 17:18:23,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565887987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:23,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:23,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283641770] [2022-04-18 17:18:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:23,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:23,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:23,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,194 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:23,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:23,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:23,435 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-04-18 17:18:23,436 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-04-18 17:18:23,436 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-04-18 17:18:23,436 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-04-18 17:18:23,437 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-04-18 17:18:23,437 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-04-18 17:18:23,437 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-04-18 17:18:23,437 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-04-18 17:18:23,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 17:18:23,445 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-18 17:18:23,445 INFO L306 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2022-04-18 17:18:23,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:23,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:23,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-04-18 17:18:23,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-04-18 17:18:23,460 INFO L340 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=PARTIAL_ORDER_FA, 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 [2022-04-18 17:18:23,460 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-18 17:18:23,509 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -705033648, now seen corresponding path program 1 times [2022-04-18 17:18:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:23,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502132566] [2022-04-18 17:18:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:23,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:18:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:23,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:18:23,593 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:18:23,595 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-04-18 17:18:23,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 17:18:23,601 INFO L719 BasicCegarLoop]: Path program histogram: [1] [2022-04-18 17:18:23,602 INFO L306 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2022-04-18 17:18:23,603 WARN L232 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 17:18:23,603 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-04-18 17:18:23,647 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:23,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:23,684 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:23,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-04-18 17:18:23,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-04-18 17:18:23,687 INFO L340 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=PARTIAL_ORDER_FA, 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 [2022-04-18 17:18:23,688 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-18 17:18:23,828 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:23,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -703700692, now seen corresponding path program 1 times [2022-04-18 17:18:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:23,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970125734] [2022-04-18 17:18:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:18:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:23,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970125734] [2022-04-18 17:18:23,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970125734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:23,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:23,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333207811] [2022-04-18 17:18:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:23,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:23,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:23,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:23,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,861 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:23,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:23,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:23,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 17:18:23,869 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-04-18 17:18:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -919468196, now seen corresponding path program 1 times [2022-04-18 17:18:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:23,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540387162] [2022-04-18 17:18:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:23,892 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-18 17:18:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-18 17:18:23,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-18 17:18:23,916 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-18 17:18:23,917 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-04-18 17:18:23,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 17:18:23,921 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-18 17:18:23,922 INFO L306 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2022-04-18 17:18:23,922 WARN L232 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-04-18 17:18:23,922 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-04-18 17:18:23,954 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-04-18 17:18:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-04-18 17:18:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:23,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-04-18 17:18:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-04-18 17:18:23,964 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2022-04-18 17:18:23,965 INFO L340 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=PARTIAL_ORDER_FA, 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 [2022-04-18 17:18:23,965 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-04-18 17:18:24,111 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash 104690387, now seen corresponding path program 1 times [2022-04-18 17:18:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444974744] [2022-04-18 17:18:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-18 17:18:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:24,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444974744] [2022-04-18 17:18:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444974744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:24,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:24,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928338570] [2022-04-18 17:18:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:24,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 17:18:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 17:18:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 17:18:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,188 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:24,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:24,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 17:18:24,297 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2047425953, now seen corresponding path program 1 times [2022-04-18 17:18:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:24,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832565161] [2022-04-18 17:18:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832565161] [2022-04-18 17:18:24,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832565161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:24,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:24,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:18:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701759532] [2022-04-18 17:18:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:24,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 17:18:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 17:18:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 17:18:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,428 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:24,429 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:24,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:24,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 17:18:24,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:24,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1657992580, now seen corresponding path program 1 times [2022-04-18 17:18:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:24,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188727577] [2022-04-18 17:18:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:24,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188727577] [2022-04-18 17:18:24,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188727577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:24,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:24,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:24,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737703110] [2022-04-18 17:18:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:24,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:24,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,564 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:24,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 40.0) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:24,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:24,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:24,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:24,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 17:18:24,588 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1500166454, now seen corresponding path program 1 times [2022-04-18 17:18:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:24,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82764019] [2022-04-18 17:18:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82764019] [2022-04-18 17:18:24,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82764019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:24,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:24,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 17:18:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177656241] [2022-04-18 17:18:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:24,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:24,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,627 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:24,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 42.5) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:24,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:24,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:24,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:24,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 17:18:25,093 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1504459159, now seen corresponding path program 1 times [2022-04-18 17:18:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:25,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693905958] [2022-04-18 17:18:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-18 17:18:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:25,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693905958] [2022-04-18 17:18:25,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693905958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:18:25,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:18:25,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:18:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036738940] [2022-04-18 17:18:25,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:18:25,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:18:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:18:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:18:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,204 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:25,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:25,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:25,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:25,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 17:18:25,484 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash -880892859, now seen corresponding path program 1 times [2022-04-18 17:18:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:25,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803191164] [2022-04-18 17:18:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 284 proven. 110 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:18:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803191164] [2022-04-18 17:18:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803191164] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:18:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438036643] [2022-04-18 17:18:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:25,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:25,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:25,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:18:25,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 17:18:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:26,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 17:18:26,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:18:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-04-18 17:18:26,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:18:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 268 proven. 2 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-04-18 17:18:27,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438036643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:18:27,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:18:27,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 25 [2022-04-18 17:18:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843956472] [2022-04-18 17:18:27,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:18:27,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-18 17:18:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:27,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-18 17:18:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-04-18 17:18:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:27,324 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:27,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 16.48) internal successors, (412), 25 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:27,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:27,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:27,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:27,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:27,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:27,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:18:28,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-18 17:18:28,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-18 17:18:28,518 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash -829177803, now seen corresponding path program 2 times [2022-04-18 17:18:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:28,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984706153] [2022-04-18 17:18:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:28,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:18:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984706153] [2022-04-18 17:18:32,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984706153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:18:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404186871] [2022-04-18 17:18:32,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 17:18:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:32,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:18:32,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 17:18:32,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 17:18:32,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 17:18:32,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-18 17:18:32,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:18:33,036 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:18:33,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:18:33,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:33,197 INFO L390 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 41 treesize of output 37 [2022-04-18 17:18:33,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:33,459 INFO L390 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 41 treesize of output 37 [2022-04-18 17:18:33,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:33,926 INFO L390 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 41 treesize of output 37 [2022-04-18 17:18:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:35,147 INFO L390 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 41 treesize of output 37 [2022-04-18 17:18:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:18:36,982 INFO L356 Elim1Store]: treesize reduction 66, result has 9.6 percent of original size [2022-04-18 17:18:36,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 47 treesize of output 25 [2022-04-18 17:18:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-18 17:18:37,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:18:38,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_~#storage~0.base|))) (<= (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|)) (select .cse1 (+ (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4) |c_~#storage~0.offset|)))) (<= 6 .cse0)))) is different from false [2022-04-18 17:18:38,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (< .cse1 0) (<= 6 .cse1)))) is different from false [2022-04-18 17:18:38,787 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_458 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (< .cse1 0) (<= 6 .cse1)))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:18:38,831 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_458 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (< .cse1 0) (<= 6 .cse1)))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:18:38,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_458 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 0) (<= 6 .cse1) (<= 6 .cse0) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_458) |c_~#storage~0.base|))) (<= (select .cse2 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|)) (select .cse2 (+ (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8) |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:18:41,344 INFO L356 Elim1Store]: treesize reduction 182, result has 4.7 percent of original size [2022-04-18 17:18:41,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 52 [2022-04-18 17:18:41,358 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-04-18 17:18:41,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 17:18:41,431 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:18:41,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:18:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 23 not checked. [2022-04-18 17:18:41,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404186871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:18:41,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:18:41,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 27, 27] total 82 [2022-04-18 17:18:41,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046216835] [2022-04-18 17:18:41,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:18:41,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-04-18 17:18:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:18:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-04-18 17:18:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=5520, Unknown=12, NotChecked=770, Total=6642 [2022-04-18 17:18:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:41,500 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:18:41,501 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 5.048780487804878) internal successors, (414), 82 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:18:41,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:18:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:18:53,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-18 17:18:54,013 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-18 17:18:54,014 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:18:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:18:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -596802159, now seen corresponding path program 1 times [2022-04-18 17:18:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:18:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515753648] [2022-04-18 17:18:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:18:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 15 proven. 47 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:18:56,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:18:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515753648] [2022-04-18 17:18:56,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515753648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:18:56,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830514334] [2022-04-18 17:18:56,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:18:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:18:56,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:18:56,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:18:56,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 17:18:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:18:57,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-18 17:18:57,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:18:57,303 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:18:57,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:18:57,415 INFO L390 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 59 treesize of output 51 [2022-04-18 17:18:57,659 INFO L390 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 59 treesize of output 51 [2022-04-18 17:18:58,192 INFO L390 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 59 treesize of output 51 [2022-04-18 17:18:59,266 INFO L390 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 59 treesize of output 51 [2022-04-18 17:19:03,028 INFO L390 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 12 treesize of output 3 [2022-04-18 17:19:03,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:03,469 INFO L356 Elim1Store]: treesize reduction 115, result has 8.0 percent of original size [2022-04-18 17:19:03,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 37 [2022-04-18 17:19:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 34 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:19:03,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:19:03,944 INFO L390 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 13 treesize of output 4 [2022-04-18 17:19:05,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_546) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse2 (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse2) (<= .cse2 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse0))))) is different from false [2022-04-18 17:19:05,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_546) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse2 (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)))) (or (< .cse0 0) (<= (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse2) (<= 6 .cse0) (<= .cse2 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:19:05,580 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_546 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_546) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse2 (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)))) (or (< .cse0 0) (<= (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse2) (<= 6 .cse0) (<= .cse2 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:19:05,655 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_546 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_546) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse2 (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)))) (or (< .cse0 0) (<= (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse2) (<= 6 .cse0) (<= .cse2 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:19:05,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_546) |c_~#storage~0.base|)) (.cse4 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8))) (let ((.cse1 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse3 (select .cse2 (+ .cse4 4 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 0) (<= 6 .cse1) (<= (select .cse2 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse3) (<= .cse3 (select .cse2 (+ .cse4 |c_~#storage~0.offset|))) (<= 6 .cse0))))) is different from false [2022-04-18 17:19:08,620 INFO L356 Elim1Store]: treesize reduction 468, result has 2.7 percent of original size [2022-04-18 17:19:08,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 151 treesize of output 94 [2022-04-18 17:19:08,632 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-04-18 17:19:08,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 14 [2022-04-18 17:19:08,695 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:19:08,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:19:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:19:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830514334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:19:08,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:19:08,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35, 37] total 92 [2022-04-18 17:19:08,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040067962] [2022-04-18 17:19:08,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:19:08,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-18 17:19:08,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-18 17:19:08,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=527, Invalid=6968, Unknown=7, NotChecked=870, Total=8372 [2022-04-18 17:19:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:08,748 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:08,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.804347826086956) internal successors, (442), 92 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:08,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:19:18,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 17:19:18,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-18 17:19:18,503 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:19:18,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:19:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1851546339, now seen corresponding path program 1 times [2022-04-18 17:19:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:19:18,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616649395] [2022-04-18 17:19:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:19:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-18 17:19:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:18,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616649395] [2022-04-18 17:19:18,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616649395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:19:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:19:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 17:19:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971397993] [2022-04-18 17:19:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:19:18,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 17:19:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 17:19:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-18 17:19:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:18,594 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:18,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:18,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:18,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:18,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:19:18,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-18 17:19:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:19:21,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 17:19:21,077 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:19:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:19:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash -672552584, now seen corresponding path program 1 times [2022-04-18 17:19:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:19:21,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458080258] [2022-04-18 17:19:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:19:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-18 17:19:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:21,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458080258] [2022-04-18 17:19:21,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458080258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:19:21,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:19:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 17:19:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923545714] [2022-04-18 17:19:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:19:21,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 17:19:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 17:19:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 17:19:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,129 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:21,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:19:21,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:19:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:21,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 17:19:21,163 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:19:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:19:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -672552553, now seen corresponding path program 1 times [2022-04-18 17:19:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:19:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978319660] [2022-04-18 17:19:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:19:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:19:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:19:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978319660] [2022-04-18 17:19:23,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978319660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:19:23,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529620417] [2022-04-18 17:19:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:19:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:19:23,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:19:23,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:19:23,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 17:19:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:19:24,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-18 17:19:24,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:19:24,354 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:19:24,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:19:24,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:24,466 INFO L390 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 50 treesize of output 44 [2022-04-18 17:19:24,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:24,704 INFO L390 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 50 treesize of output 44 [2022-04-18 17:19:25,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:25,123 INFO L390 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 50 treesize of output 44 [2022-04-18 17:19:26,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:26,136 INFO L390 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 50 treesize of output 44 [2022-04-18 17:19:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:19:30,459 INFO L356 Elim1Store]: treesize reduction 94, result has 38.6 percent of original size [2022-04-18 17:19:30,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 24 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 86 [2022-04-18 17:19:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:19:30,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:19:33,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_727) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ .cse3 4 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (< .cse2 (select .cse0 (+ .cse3 |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:19:33,390 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0) (forall ((v_ArrVal_727 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_727) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ .cse3 4 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (< .cse2 (select .cse0 (+ .cse3 |c_~#storage~0.offset|)))))))) is different from false [2022-04-18 17:19:33,486 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_727 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_727) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ .cse3 4 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (< .cse2 (select .cse0 (+ .cse3 |c_~#storage~0.offset|))))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:19:33,579 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_727 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_727) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ .cse3 4 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (< .cse2 (select .cse0 (+ .cse3 |c_~#storage~0.offset|)))))))) is different from false [2022-04-18 17:19:33,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_727) |c_~#storage~0.base|)) (.cse5 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8))) (let ((.cse2 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse3 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse0 (select .cse1 (+ .cse5 |c_~#storage~0.offset|))) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (<= 6 .cse4) (<= 6 .cse3) (<= (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|)) .cse0) (< .cse4 0))))) is different from false [2022-04-18 17:19:36,809 INFO L356 Elim1Store]: treesize reduction 448, result has 9.9 percent of original size [2022-04-18 17:19:36,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 182 treesize of output 152 [2022-04-18 17:19:36,829 INFO L356 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-04-18 17:19:36,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 29 [2022-04-18 17:19:36,962 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:19:36,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:19:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:19:37,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529620417] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:19:37,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:19:37,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 38, 40] total 100 [2022-04-18 17:19:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531679283] [2022-04-18 17:19:37,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:19:37,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-04-18 17:19:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:19:37,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-04-18 17:19:37,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=8464, Unknown=11, NotChecked=950, Total=9900 [2022-04-18 17:19:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:37,027 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:19:37,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 4.5) internal successors, (450), 100 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:19:37,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-18 17:20:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:20:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-04-18 17:20:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:20:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-18 17:20:07,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-18 17:20:08,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:08,044 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:08,044 INFO L85 PathProgramCache]: Analyzing trace with hash -464284811, now seen corresponding path program 1 times [2022-04-18 17:20:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:08,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491243232] [2022-04-18 17:20:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:20:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:20:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491243232] [2022-04-18 17:20:10,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491243232] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:20:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401451012] [2022-04-18 17:20:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:20:10,730 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:20:10,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-18 17:20:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:11,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-18 17:20:11,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:20:11,458 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:20:11,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:20:11,570 INFO L390 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 59 treesize of output 51 [2022-04-18 17:20:11,938 INFO L390 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 59 treesize of output 51 [2022-04-18 17:20:12,422 INFO L390 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 59 treesize of output 51 [2022-04-18 17:20:13,550 INFO L390 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 59 treesize of output 51 [2022-04-18 17:20:16,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:16,700 INFO L356 Elim1Store]: treesize reduction 60, result has 10.4 percent of original size [2022-04-18 17:20:16,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 31 [2022-04-18 17:20:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-18 17:20:16,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:20:17,753 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_800 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_800) |c_~#storage~0.base|))) (<= (select .cse0 (+ 4 (* |c_thr1Thread3of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4) |c_~#storage~0.offset|))))) (= |c_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:20:18,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_800) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8) 4 |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (<= 6 .cse1) (< .cse1 0)))) is different from false [2022-04-18 17:20:18,064 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_800 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_800) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8) 4 |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (<= 6 .cse1) (< .cse1 0)))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:20:18,097 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_800 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_800) |c_~#storage~0.base|))) (<= (select .cse0 (+ (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8) 4 |c_~#storage~0.offset|)) (select .cse0 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (<= 6 .cse1) (< .cse1 0)))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:20:18,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (< .cse0 0) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_800) |c_~#storage~0.base|))) (<= (select .cse1 (+ (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8) 4 |c_~#storage~0.offset|)) (select .cse1 (+ (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8) |c_~#storage~0.offset|)))) (<= 6 .cse2) (<= 6 .cse0) (< .cse2 0)))) is different from false [2022-04-18 17:20:20,586 INFO L356 Elim1Store]: treesize reduction 349, result has 2.5 percent of original size [2022-04-18 17:20:20,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 61 [2022-04-18 17:20:20,592 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 17:20:20,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 3 [2022-04-18 17:20:20,655 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:20:20,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:20:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 25 not checked. [2022-04-18 17:20:20,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401451012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:20:20,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:20:20,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 34] total 90 [2022-04-18 17:20:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730316372] [2022-04-18 17:20:20,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:20:20,707 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-04-18 17:20:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:20:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-04-18 17:20:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=6732, Unknown=6, NotChecked=850, Total=8010 [2022-04-18 17:20:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:20,709 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:20:20,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 4.277777777777778) internal successors, (385), 90 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-04-18 17:20:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-18 17:20:28,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-18 17:20:28,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-18 17:20:28,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:28,260 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:20:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:20:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1921759711, now seen corresponding path program 2 times [2022-04-18 17:20:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:20:28,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103524901] [2022-04-18 17:20:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:20:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:20:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:20:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-18 17:20:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:20:30,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103524901] [2022-04-18 17:20:30,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103524901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:20:30,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038809604] [2022-04-18 17:20:30,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 17:20:30,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:20:30,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:20:30,074 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:20:30,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-18 17:20:30,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 17:20:30,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 17:20:30,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-18 17:20:30,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:20:30,738 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:20:30,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:20:30,825 INFO L390 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 41 treesize of output 37 [2022-04-18 17:20:30,995 INFO L390 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 41 treesize of output 37 [2022-04-18 17:20:31,321 INFO L390 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 41 treesize of output 37 [2022-04-18 17:20:32,193 INFO L390 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 41 treesize of output 37 [2022-04-18 17:20:35,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:20:35,911 INFO L356 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2022-04-18 17:20:35,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 38 [2022-04-18 17:20:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:20:36,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:20:37,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_888 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_888) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse1 (select .cse0 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= (select .cse0 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse1) (< .cse2 0) (< .cse1 (select .cse0 (+ .cse3 4 |c_~#storage~0.offset|))) (<= 6 .cse2))))) is different from false [2022-04-18 17:20:37,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_888 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_888) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (<= (select .cse2 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse1) (<= 6 .cse0))))) is different from false [2022-04-18 17:20:37,628 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_888 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_888) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (<= (select .cse2 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse1) (<= 6 .cse0))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:20:37,698 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_888 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_888) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (<= (select .cse2 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse1) (<= 6 .cse0))))) (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:20:37,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_888 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_888) |c_~#storage~0.base|)) (.cse4 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8))) (let ((.cse1 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse2 (select .cse3 (+ .cse4 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 0) (< .cse2 (select .cse3 (+ .cse4 4 |c_~#storage~0.offset|))) (<= 6 .cse1) (<= (select .cse3 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) 4 |c_~#storage~0.offset|)) .cse2) (<= 6 .cse0))))) is different from false [2022-04-18 17:20:39,943 INFO L356 Elim1Store]: treesize reduction 270, result has 6.6 percent of original size [2022-04-18 17:20:39,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 129 treesize of output 91 [2022-04-18 17:20:39,956 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-04-18 17:20:39,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 22 [2022-04-18 17:20:40,021 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:20:40,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:20:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:20:40,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038809604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:20:40,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:20:40,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34, 34] total 88 [2022-04-18 17:20:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61466908] [2022-04-18 17:20:40,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:20:40,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-04-18 17:20:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:20:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-04-18 17:20:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=6393, Unknown=10, NotChecked=830, Total=7656 [2022-04-18 17:20:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:40,062 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:20:40,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 5.034090909090909) internal successors, (443), 88 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-04-18 17:20:40,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:21:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-04-18 17:21:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-18 17:21:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-18 17:21:17,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-18 17:21:17,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-04-18 17:21:17,817 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:21:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:21:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1465180487, now seen corresponding path program 1 times [2022-04-18 17:21:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:21:17,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017449755] [2022-04-18 17:21:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:21:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:21:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:21:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-18 17:21:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:21:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017449755] [2022-04-18 17:21:19,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017449755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:21:19,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875782478] [2022-04-18 17:21:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:21:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:21:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:21:19,386 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:21:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-18 17:21:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:21:19,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-18 17:21:19,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:21:19,917 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:21:19,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:21:20,006 INFO L390 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 43 treesize of output 39 [2022-04-18 17:21:20,180 INFO L390 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 43 treesize of output 39 [2022-04-18 17:21:20,534 INFO L390 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 43 treesize of output 39 [2022-04-18 17:21:21,409 INFO L390 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 43 treesize of output 39 [2022-04-18 17:21:22,577 INFO L390 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 12 treesize of output 3 [2022-04-18 17:21:25,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:25,352 INFO L356 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2022-04-18 17:21:25,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 63 [2022-04-18 17:21:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 24 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:21:25,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:21:26,740 INFO L390 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 13 treesize of output 4 [2022-04-18 17:21:27,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_976) |c_~#storage~0.base|)) (.cse3 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse4 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (<= 6 .cse4))))) is different from false [2022-04-18 17:21:27,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_976) |c_~#storage~0.base|)) (.cse3 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse4 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (<= 6 .cse4))))) is different from false [2022-04-18 17:21:27,799 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0) (forall ((v_ArrVal_976 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_976) |c_~#storage~0.base|)) (.cse3 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse4 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (<= 6 .cse4)))))) is different from false [2022-04-18 17:21:27,868 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_976 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_976) |c_~#storage~0.base|)) (.cse3 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse4 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (<= 6 .cse4)))))) is different from false [2022-04-18 17:21:28,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_976 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_976) |c_~#storage~0.base|)) (.cse1 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse5 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8)) (.cse4 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse3 0) (< .cse4 0) (< .cse2 (select .cse0 (+ .cse5 |c_~#storage~0.offset|))) (< .cse2 (select .cse0 (+ .cse5 4 |c_~#storage~0.offset|))) (<= 6 .cse4) (<= 6 .cse3))))) is different from false [2022-04-18 17:21:30,963 INFO L356 Elim1Store]: treesize reduction 378, result has 7.1 percent of original size [2022-04-18 17:21:30,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 128 [2022-04-18 17:21:31,007 INFO L356 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-04-18 17:21:31,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 29 [2022-04-18 17:21:31,105 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:21:31,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:21:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:21:31,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875782478] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:21:31,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:21:31,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 37, 37] total 97 [2022-04-18 17:21:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443294906] [2022-04-18 17:21:31,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:21:31,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-18 17:21:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:21:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-18 17:21:31,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=7897, Unknown=7, NotChecked=920, Total=9312 [2022-04-18 17:21:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:31,155 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:21:31,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 4.597938144329897) internal successors, (446), 97 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-04-18 17:21:31,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-18 17:21:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-04-18 17:21:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-18 17:21:49,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-18 17:21:49,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:21:49,303 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:21:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:21:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1012808307, now seen corresponding path program 1 times [2022-04-18 17:21:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:21:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952151009] [2022-04-18 17:21:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:21:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:21:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:21:51,934 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:21:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:21:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952151009] [2022-04-18 17:21:51,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952151009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:21:51,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115261984] [2022-04-18 17:21:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:21:51,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:21:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:21:51,936 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:21:51,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-18 17:21:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:21:52,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-18 17:21:52,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:21:52,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:21:52,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:21:52,744 INFO L390 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 50 treesize of output 44 [2022-04-18 17:21:52,947 INFO L390 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 50 treesize of output 44 [2022-04-18 17:21:53,314 INFO L390 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 50 treesize of output 44 [2022-04-18 17:21:54,345 INFO L390 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 50 treesize of output 44 [2022-04-18 17:21:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:21:57,273 INFO L356 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2022-04-18 17:21:57,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 67 treesize of output 51 [2022-04-18 17:21:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:21:57,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:21:58,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4) |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) is different from false [2022-04-18 17:21:58,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) is different from false [2022-04-18 17:21:58,904 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0) (forall ((|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3)))))) is different from false [2022-04-18 17:21:58,954 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0) (forall ((|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3)))))) is different from false [2022-04-18 17:21:59,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int) (v_ArrVal_1050 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse1 (select .cse0 (+ .cse2 |c_~#storage~0.offset|))) (.cse4 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= (select .cse0 (+ (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8) |c_~#storage~0.offset|)) .cse1) (< .cse1 (select .cse0 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse4 0) (<= 6 .cse4) (<= 6 .cse3))))) is different from false [2022-04-18 17:22:01,328 INFO L356 Elim1Store]: treesize reduction 343, result has 7.8 percent of original size [2022-04-18 17:22:01,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 137 treesize of output 104 [2022-04-18 17:22:01,340 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-04-18 17:22:01,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2022-04-18 17:22:01,399 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:22:01,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:22:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:22:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115261984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:22:01,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:22:01,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 33] total 90 [2022-04-18 17:22:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326466770] [2022-04-18 17:22:01,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:22:01,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-04-18 17:22:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:22:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-04-18 17:22:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=6678, Unknown=10, NotChecked=850, Total=8010 [2022-04-18 17:22:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:22:01,450 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:22:01,450 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 4.366666666666666) internal successors, (393), 90 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:22:01,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:22:01,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:22:01,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:22:01,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 135 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-04-18 17:22:01,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-18 17:23:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-04-18 17:23:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-18 17:23:03,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-18 17:23:03,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-18 17:23:03,725 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:23:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:23:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -616734061, now seen corresponding path program 2 times [2022-04-18 17:23:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:23:03,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638744271] [2022-04-18 17:23:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:23:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:23:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:23:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:23:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:23:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638744271] [2022-04-18 17:23:06,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638744271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:23:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747655334] [2022-04-18 17:23:06,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-18 17:23:06,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:23:06,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:23:06,248 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:23:06,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-18 17:23:06,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-18 17:23:06,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 17:23:06,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-18 17:23:06,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:23:07,256 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:23:07,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:23:07,360 INFO L390 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 41 treesize of output 37 [2022-04-18 17:23:07,559 INFO L390 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 41 treesize of output 37 [2022-04-18 17:23:07,926 INFO L390 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 41 treesize of output 37 [2022-04-18 17:23:08,943 INFO L390 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 41 treesize of output 37 [2022-04-18 17:23:12,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:23:12,047 INFO L356 Elim1Store]: treesize reduction 76, result has 18.3 percent of original size [2022-04-18 17:23:12,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 38 [2022-04-18 17:23:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:23:12,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:23:13,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1122) |c_~#storage~0.base|))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse1 (select .cse2 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= 6 .cse0) (<= .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (< .cse0 0) (<= .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:23:13,932 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0) (forall ((|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1122) |c_~#storage~0.base|))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse1 (select .cse2 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= 6 .cse0) (<= .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (< .cse0 0) (<= .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|)))))))) is different from false [2022-04-18 17:23:13,982 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0) (forall ((|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1122 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1122) |c_~#storage~0.base|))) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse1 (select .cse2 (+ (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (<= 6 .cse0) (<= .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (< .cse0 0) (<= .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|)))))))) is different from false [2022-04-18 17:23:14,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1122 (Array Int Int)) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1122) |c_~#storage~0.base|))) (let ((.cse0 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse1 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse3 (+ (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8) |c_~#storage~0.offset|))) (.cse4 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8))) (or (< .cse0 0) (<= 6 .cse1) (<= 6 .cse0) (< .cse1 0) (<= .cse2 (select .cse3 (+ .cse4 4 |c_~#storage~0.offset|))) (<= .cse2 (select .cse3 (+ .cse4 |c_~#storage~0.offset|))))))) is different from false [2022-04-18 17:23:16,590 INFO L356 Elim1Store]: treesize reduction 264, result has 6.7 percent of original size [2022-04-18 17:23:16,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 127 treesize of output 90 [2022-04-18 17:23:16,600 INFO L356 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2022-04-18 17:23:16,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 14 [2022-04-18 17:23:16,662 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:23:16,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:23:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 23 not checked. [2022-04-18 17:23:16,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747655334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:23:16,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:23:16,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 93 [2022-04-18 17:23:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509235885] [2022-04-18 17:23:16,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:23:16,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-04-18 17:23:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:23:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-04-18 17:23:16,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=7314, Unknown=8, NotChecked=708, Total=8556 [2022-04-18 17:23:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:16,716 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:23:16,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 4.268817204301075) internal successors, (397), 93 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 167 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:23:16,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2022-04-18 17:23:16,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2022-04-18 17:23:16,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-04-18 17:23:16,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-04-18 17:23:16,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:23:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:23:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-04-18 17:23:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-18 17:23:59,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-18 17:24:00,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-18 17:24:00,162 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:24:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:24:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1487210047, now seen corresponding path program 1 times [2022-04-18 17:24:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:24:00,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982144472] [2022-04-18 17:24:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:24:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:24:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:24:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 29 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-18 17:24:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:24:01,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982144472] [2022-04-18 17:24:01,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982144472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:24:01,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926729227] [2022-04-18 17:24:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:24:01,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:24:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:24:01,492 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:24:01,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-18 17:24:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:24:01,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-18 17:24:01,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:24:01,929 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:24:01,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:24:02,012 INFO L390 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 32 treesize of output 30 [2022-04-18 17:24:02,307 INFO L390 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 32 treesize of output 30 [2022-04-18 17:24:02,647 INFO L390 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 32 treesize of output 30 [2022-04-18 17:24:03,072 INFO L390 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 32 treesize of output 30 [2022-04-18 17:24:03,822 INFO L356 Elim1Store]: treesize reduction 28, result has 9.7 percent of original size [2022-04-18 17:24:03,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 16 [2022-04-18 17:24:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-18 17:24:04,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:24:04,312 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1210 (Array Int Int))) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1210) |c_~#storage~0.base|) (+ (* |c_thr1Thread3of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|)))) (= |c_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:24:04,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< c_~max~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1210) |c_~#storage~0.base|) (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (<= 6 .cse0)))) is different from false [2022-04-18 17:24:05,399 INFO L356 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2022-04-18 17:24:05,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 38 [2022-04-18 17:24:05,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-04-18 17:24:05,750 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:24:05,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:24:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 14 not checked. [2022-04-18 17:24:05,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926729227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:24:05,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:24:05,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 52 [2022-04-18 17:24:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130714540] [2022-04-18 17:24:05,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:24:05,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-18 17:24:05,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:24:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-18 17:24:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2166, Unknown=3, NotChecked=194, Total=2652 [2022-04-18 17:24:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:24:05,796 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:24:05,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 6.230769230769231) internal successors, (324), 52 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 172 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 147 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-04-18 17:24:05,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:24:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2022-04-18 17:24:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-04-18 17:24:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-18 17:24:52,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-18 17:24:52,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:24:52,388 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:24:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:24:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1905383924, now seen corresponding path program 1 times [2022-04-18 17:24:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:24:52,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183485818] [2022-04-18 17:24:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:24:52,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:24:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:24:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-18 17:24:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:24:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183485818] [2022-04-18 17:24:54,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183485818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:24:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611370440] [2022-04-18 17:24:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:24:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:24:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:24:54,924 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:24:54,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-18 17:24:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:24:55,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-18 17:24:55,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:24:55,525 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:24:55,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:24:55,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:24:55,656 INFO L390 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 59 treesize of output 51 [2022-04-18 17:24:55,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:24:55,930 INFO L390 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 59 treesize of output 51 [2022-04-18 17:24:56,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:24:56,429 INFO L390 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 59 treesize of output 51 [2022-04-18 17:24:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:24:57,958 INFO L390 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 59 treesize of output 51 [2022-04-18 17:25:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:25:03,063 INFO L356 Elim1Store]: treesize reduction 66, result has 9.6 percent of original size [2022-04-18 17:25:03,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 31 [2022-04-18 17:25:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-18 17:25:03,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:25:04,706 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1298 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|)))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ (* |c_thr1Thread3of3ForFork0_~offset~0#1| 4) |c_~#storage~0.offset|))))))) (= |c_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:25:04,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse1 (* |c_thr1Thread2of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse2 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse2 (select .cse0 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (< .cse3 0) (<= 6 .cse3))))) is different from false [2022-04-18 17:25:04,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (< .cse2 0) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse2))))) is different from false [2022-04-18 17:25:04,969 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| 0) (forall ((v_ArrVal_1298 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (< .cse2 0) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse2)))))) is different from false [2022-04-18 17:25:05,038 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| 0) (forall ((v_ArrVal_1298 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse3 (* |c_thr1Thread2of3ForFork0_~offset~0#1| 4))) (let ((.cse0 (select .cse1 (+ .cse3 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (< .cse2 0) (<= (select .cse1 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse2)))))) is different from false [2022-04-18 17:25:05,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1298 (Array Int Int)) (|aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| Int) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1298) |c_~#storage~0.base|)) (.cse4 (* |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44| 8))) (let ((.cse3 (* 2 |aux_div_thr1Thread2of3ForFork0_~offset~0#1_44|)) (.cse0 (select .cse1 (+ .cse4 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|) |c_~#storage~0.offset|))) (< .cse2 0) (< .cse3 0) (<= 6 .cse3) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse2))))) is different from false [2022-04-18 17:25:08,033 INFO L356 Elim1Store]: treesize reduction 460, result has 2.7 percent of original size [2022-04-18 17:25:08,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 147 treesize of output 92 [2022-04-18 17:25:08,048 INFO L356 Elim1Store]: treesize reduction 39, result has 23.5 percent of original size [2022-04-18 17:25:08,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 19 [2022-04-18 17:25:08,108 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:25:08,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:25:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 20 not checked. [2022-04-18 17:25:08,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611370440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:25:08,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:25:08,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 34] total 90 [2022-04-18 17:25:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35640815] [2022-04-18 17:25:08,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:25:08,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-04-18 17:25:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:25:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-04-18 17:25:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=6504, Unknown=7, NotChecked=1014, Total=8010 [2022-04-18 17:25:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:25:08,159 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:25:08,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 4.888888888888889) internal successors, (440), 90 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:25:08,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:25:08,159 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 179 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 164 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 99 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-04-18 17:25:08,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:24,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-18 17:28:24,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:28:24,468 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:28:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:28:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 856853899, now seen corresponding path program 1 times [2022-04-18 17:28:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:28:24,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944938859] [2022-04-18 17:28:24,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:28:24,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:28:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:28:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-18 17:28:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:28:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944938859] [2022-04-18 17:28:24,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944938859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:28:24,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:28:24,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 17:28:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431414217] [2022-04-18 17:28:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:28:24,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 17:28:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:28:24,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 17:28:24,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-18 17:28:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,539 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:28:24,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:28:24,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:24,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-18 17:28:24,765 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:28:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:28:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1089158995, now seen corresponding path program 1 times [2022-04-18 17:28:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:28:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603829298] [2022-04-18 17:28:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:28:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:28:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:28:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-18 17:28:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:28:24,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603829298] [2022-04-18 17:28:24,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603829298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 17:28:24,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 17:28:24,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 17:28:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563075782] [2022-04-18 17:28:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 17:28:24,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 17:28:24,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:28:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 17:28:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-18 17:28:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,815 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:28:24,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:28:24,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:28:24,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-18 17:28:24,882 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:28:24,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:28:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash 153884273, now seen corresponding path program 1 times [2022-04-18 17:28:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:28:24,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504853330] [2022-04-18 17:28:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:28:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:28:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:28:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:28:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:28:27,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504853330] [2022-04-18 17:28:27,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504853330] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:28:27,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685955646] [2022-04-18 17:28:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:28:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:28:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:28:27,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:28:27,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-18 17:28:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:28:27,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-18 17:28:27,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:28:27,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:28:27,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:28:27,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:27,973 INFO L390 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 41 treesize of output 37 [2022-04-18 17:28:28,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:28,419 INFO L390 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 41 treesize of output 37 [2022-04-18 17:28:29,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:29,144 INFO L390 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 41 treesize of output 37 [2022-04-18 17:28:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:30,135 INFO L390 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 52 treesize of output 46 [2022-04-18 17:28:37,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:28:37,219 INFO L356 Elim1Store]: treesize reduction 96, result has 25.6 percent of original size [2022-04-18 17:28:37,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 57 [2022-04-18 17:28:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 33 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 17:28:37,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:28:39,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|))) (let ((.cse3 (select .cse1 (+ (* 4 |c_thr1Thread1of3ForFork0_findMax_~i~0#1|) 4 |c_~#storage~0.offset|))) (.cse4 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) .cse3) (<= .cse4 |c_thr1Thread1of3ForFork0_findMax_#t~mem6#1|) (<= .cse3 .cse4) (<= 6 .cse0))))) is different from false [2022-04-18 17:28:39,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_findMax_~i~0#1|))) (let ((.cse3 (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse4 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) .cse3) (<= .cse4 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (<= .cse3 .cse4) (<= 6 .cse0))))) is different from false [2022-04-18 17:28:39,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* |c_thr1Thread1of3ForFork0_findMax_~offset#1| 4))) (let ((.cse1 (select .cse3 (+ 4 |c_~#storage~0.offset| .cse5))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse2 (select .cse3 (+ .cse4 |c_~#storage~0.offset|)))) (or (< .cse0 0) (<= .cse1 .cse2) (<= (select .cse3 (+ .cse4 4 |c_~#storage~0.offset|)) .cse1) (<= 6 .cse0) (<= .cse2 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ |c_~#storage~0.offset| .cse5))))))) is different from false [2022-04-18 17:28:39,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse3 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4)) (.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (let ((.cse1 (select .cse4 (+ .cse5 |c_~#storage~0.offset|))) (.cse0 (select .cse4 (+ .cse3 4 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= .cse0 .cse1) (< .cse2 0) (<= .cse1 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse3 |c_~#storage~0.offset|))) (<= (select .cse4 (+ .cse5 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse2))))) is different from false [2022-04-18 17:28:39,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse0 (select .cse3 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse1 (select .cse3 (+ .cse4 |c_~#storage~0.offset|))) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (<= .cse0 .cse1) (< .cse2 0) (<= (select .cse3 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1477) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (<= 6 .cse2))))) is different from false [2022-04-18 17:28:40,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse3 (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse4 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) .cse3) (<= .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1477) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (<= .cse3 .cse4) (<= 6 .cse0))))) is different from false [2022-04-18 17:28:40,303 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse3 (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse4 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) .cse3) (<= .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1477) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (<= .cse3 .cse4) (<= 6 .cse0))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:28:40,393 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse3 (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse4 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (<= (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|)) .cse3) (<= .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1477) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (<= .cse3 .cse4) (<= 6 .cse0))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:28:40,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1477 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse5 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1478) |c_~#storage~0.base|)) (.cse3 (* 8 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|))) (let ((.cse1 (* 2 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|)) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse6 (select .cse4 (+ .cse3 4 |c_~#storage~0.offset|))) (.cse2 (select .cse4 (+ .cse5 |c_~#storage~0.offset|)))) (or (< .cse0 0) (< .cse1 0) (<= .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1477) |c_~#storage~0.base|) (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse1) (<= (select .cse4 (+ .cse5 4 |c_~#storage~0.offset|)) .cse6) (<= 6 .cse0) (<= .cse6 .cse2))))) is different from false [2022-04-18 17:28:44,720 INFO L356 Elim1Store]: treesize reduction 312, result has 20.6 percent of original size [2022-04-18 17:28:44,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 228 treesize of output 219 [2022-04-18 17:28:44,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:28:44,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 17:28:44,742 INFO L356 Elim1Store]: treesize reduction 11, result has 38.9 percent of original size [2022-04-18 17:28:44,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 48 [2022-04-18 17:28:44,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-04-18 17:28:44,850 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:28:44,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:28:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2022-04-18 17:28:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685955646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:28:44,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:28:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 39, 41] total 102 [2022-04-18 17:28:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9226086] [2022-04-18 17:28:44,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:28:44,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-04-18 17:28:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:28:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-04-18 17:28:44,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=8069, Unknown=12, NotChecked=1710, Total=10302 [2022-04-18 17:28:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:44,902 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:28:44,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 4.990196078431373) internal successors, (509), 102 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:28:44,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:28:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:28:44,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:28:44,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:00,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:29:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:29:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-18 17:29:00,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-18 17:29:00,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-18 17:29:00,951 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:29:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:29:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1925036909, now seen corresponding path program 1 times [2022-04-18 17:29:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:29:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102326579] [2022-04-18 17:29:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:29:00,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:29:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:29:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 29 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:29:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:29:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102326579] [2022-04-18 17:29:03,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102326579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:29:03,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514086853] [2022-04-18 17:29:03,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:29:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:29:03,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:29:03,039 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:29:03,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-18 17:29:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:29:03,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-18 17:29:03,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:29:03,558 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:29:03,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:29:03,641 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:04,023 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:04,997 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:05,887 INFO L390 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 70 treesize of output 60 [2022-04-18 17:29:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 17:29:12,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:29:15,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* |c_thr1Thread1of3ForFork0_findMax_~offset#1| 4))) (let ((.cse1 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse2 (select .cse0 (+ 4 |c_~#storage~0.offset| .cse5))) (.cse4 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ |c_~#storage~0.offset| .cse5)))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (<= 6 .cse3) (< .cse4 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (< .cse3 0) (<= .cse2 .cse4))))) is different from false [2022-04-18 17:29:15,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse0 (select .cse2 (+ .cse5 4 |c_~#storage~0.offset|)))) (or (<= .cse0 .cse1) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (<= (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0))))) is different from false [2022-04-18 17:29:15,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1565) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse0 (select .cse2 (+ .cse5 4 |c_~#storage~0.offset|)))) (or (<= .cse0 .cse1) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0) (<= (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0))))) is different from false [2022-04-18 17:29:15,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse0 (select .cse2 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1565) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (<= .cse0 .cse1) (<= (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0))))) is different from false [2022-04-18 17:29:16,308 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse0 (select .cse2 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1565) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (<= .cse0 .cse1) (<= (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:29:16,433 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse5 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse0 (select .cse2 (+ .cse5 4 |c_~#storage~0.offset|))) (.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1565) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse3 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse4 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|))) (or (<= .cse0 .cse1) (<= (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|)) .cse0) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (<= 6 .cse4) (< .cse4 0))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:29:17,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1565 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1566) |c_~#storage~0.base|)) (.cse6 (* 8 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|))) (let ((.cse2 (select .cse0 (+ .cse6 4 |c_~#storage~0.offset|))) (.cse5 (* 2 |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45|)) (.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1565) |c_~#storage~0.base|) (+ .cse6 |c_~#storage~0.offset|))) (.cse1 (* |aux_div_thr1Thread3of3ForFork0_#t~nondet8#1_45| 8)) (.cse3 (* 2 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|))) (or (<= (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|)) .cse2) (< .cse3 0) (<= .cse2 .cse4) (<= 6 .cse5) (< .cse5 0) (< .cse4 (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:20,192 INFO L356 Elim1Store]: treesize reduction 596, result has 2.8 percent of original size [2022-04-18 17:29:20,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 304 treesize of output 202 [2022-04-18 17:29:20,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-04-18 17:29:20,210 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-04-18 17:29:20,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 14 [2022-04-18 17:29:20,271 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:29:20,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:29:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-04-18 17:29:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514086853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:29:20,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:29:20,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 36, 43] total 93 [2022-04-18 17:29:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570327668] [2022-04-18 17:29:20,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:29:20,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-04-18 17:29:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:29:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-04-18 17:29:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=6712, Unknown=13, NotChecked=1218, Total=8556 [2022-04-18 17:29:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:20,326 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:29:20,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 4.924731182795699) internal successors, (458), 93 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:29:20,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:20,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:29:20,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-04-18 17:29:20,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:29:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:29:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-18 17:29:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:32,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-18 17:29:33,057 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-18 17:29:33,058 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-04-18 17:29:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 17:29:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -331180016, now seen corresponding path program 1 times [2022-04-18 17:29:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 17:29:33,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120196713] [2022-04-18 17:29:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:29:33,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 17:29:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:29:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 17:29:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 17:29:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120196713] [2022-04-18 17:29:35,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120196713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 17:29:35,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643486992] [2022-04-18 17:29:35,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 17:29:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 17:29:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2022-04-18 17:29:35,001 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 17:29:35,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-18 17:29:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 17:29:35,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-18 17:29:35,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 17:29:35,635 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 17:29:35,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-04-18 17:29:35,772 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:36,302 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:37,509 INFO L390 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 59 treesize of output 51 [2022-04-18 17:29:39,172 INFO L390 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 70 treesize of output 60 [2022-04-18 17:29:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:44,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 17:29:45,018 INFO L356 Elim1Store]: treesize reduction 115, result has 8.0 percent of original size [2022-04-18 17:29:45,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 26 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 37 [2022-04-18 17:29:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 17:29:45,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 17:29:47,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse1 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse2 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< |c_thr1Thread1of3ForFork0_findMax_#t~mem6#1| (select .cse0 (+ .cse1 |c_~#storage~0.offset|))) (< .cse2 0) (< |c_thr1Thread1of3ForFork0_findMax_#t~mem6#1| (select .cse0 (+ .cse1 4 |c_~#storage~0.offset|))) (<= (select .cse0 (+ (* 4 |c_thr1Thread1of3ForFork0_findMax_~i~0#1|) 4 |c_~#storage~0.offset|)) |c_thr1Thread1of3ForFork0_findMax_#t~mem6#1|) (<= 6 .cse2)))) is different from false [2022-04-18 17:29:47,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 4 |c_thr1Thread1of3ForFork0_findMax_~i~0#1|))) (let ((.cse0 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:47,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* |c_thr1Thread1of3ForFork0_findMax_~offset#1| 4))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ |c_~#storage~0.offset| .cse4))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (<= (select .cse1 (+ 4 |c_~#storage~0.offset| .cse4)) .cse0) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:47,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select |c_#memory_int| |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:47,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* |c_thr1Thread1of3ForFork0_findMax_#in~offset#1| 4))) (let ((.cse3 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1653) |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse0 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 0) (< .cse1 (select .cse2 (+ .cse3 |c_~#storage~0.offset|))) (< .cse1 (select .cse2 (+ .cse3 4 |c_~#storage~0.offset|))) (<= (select .cse2 (+ .cse4 4 |c_~#storage~0.offset|)) .cse1) (<= 6 .cse0))))) is different from false [2022-04-18 17:29:47,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1653) |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:48,207 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1653) |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| 0)) is different from false [2022-04-18 17:29:48,342 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse4 (* 4 |c_thr1Thread1of3ForFork0_~offset~0#1|))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1653) |c_~#storage~0.base|) (+ .cse4 |c_~#storage~0.offset|))) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (<= (select .cse1 (+ .cse4 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse3))))) (= |c_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-04-18 17:29:48,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45| Int) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1653 (Array Int Int)) (|aux_div_thr1Thread3of3ForFork0_~offset~0#1_44| Int)) (let ((.cse5 (* 8 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|))) (let ((.cse2 (* 8 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1654) |c_~#storage~0.base|)) (.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1653) |c_~#storage~0.base|) (+ .cse5 |c_~#storage~0.offset|))) (.cse4 (* 2 |aux_div_thr1Thread1of3ForFork0_#t~nondet8#1_45|)) (.cse3 (* 2 |aux_div_thr1Thread3of3ForFork0_~offset~0#1_44|))) (or (< .cse0 (select .cse1 (+ .cse2 4 |c_~#storage~0.offset|))) (< .cse3 0) (< .cse0 (select .cse1 (+ .cse2 |c_~#storage~0.offset|))) (< .cse4 0) (<= (select .cse1 (+ .cse5 4 |c_~#storage~0.offset|)) .cse0) (<= 6 .cse4) (<= 6 .cse3))))) is different from false [2022-04-18 17:29:51,394 INFO L356 Elim1Store]: treesize reduction 596, result has 2.8 percent of original size [2022-04-18 17:29:51,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 358 treesize of output 240 [2022-04-18 17:29:51,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-04-18 17:29:51,412 INFO L356 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-04-18 17:29:51,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 14 [2022-04-18 17:29:51,477 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-04-18 17:29:51,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-04-18 17:29:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 38 not checked. [2022-04-18 17:29:51,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643486992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 17:29:51,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 17:29:51,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39, 41] total 97 [2022-04-18 17:29:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43806426] [2022-04-18 17:29:51,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 17:29:51,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-04-18 17:29:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 17:29:51,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-04-18 17:29:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=7123, Unknown=20, NotChecked=1620, Total=9312 [2022-04-18 17:29:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:51,530 INFO L478 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-04-18 17:29:51,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 4.783505154639175) internal successors, (464), 97 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 17:29:51,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-04-18 17:29:51,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-04-18 17:29:51,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 212 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 214 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 130 states. [2022-04-18 17:29:51,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 245 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-04-18 17:29:51,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-04-18 17:29:51,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15