/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 04:51:18,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 04:51:18,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 04:51:18,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 04:51:18,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 04:51:18,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 04:51:18,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 04:51:18,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 04:51:18,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 04:51:18,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 04:51:18,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 04:51:18,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 04:51:18,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 04:51:18,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 04:51:18,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 04:51:18,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 04:51:18,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 04:51:18,345 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 04:51:18,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 04:51:18,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 04:51:18,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 04:51:18,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 04:51:18,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 04:51:18,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 04:51:18,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 04:51:18,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 04:51:18,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 04:51:18,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 04:51:18,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 04:51:18,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 04:51:18,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 04:51:18,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 04:51:18,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 04:51:18,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 04:51:18,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 04:51:18,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 04:51:18,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 04:51:18,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 04:51:18,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 04:51:18,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 04:51:18,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 04:51:18,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 04:51:18,403 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 04:51:18,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 04:51:18,404 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 04:51:18,404 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 04:51:18,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 04:51:18,405 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 04:51:18,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 04:51:18,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 04:51:18,406 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 04:51:18,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 04:51:18,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 04:51:18,408 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 04:51:18,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 04:51:18,408 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 04:51:18,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 04:51:18,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 04:51:18,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 04:51:18,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 04:51:18,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 04:51:18,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:51:18,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 04:51:18,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 04:51:18,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 04:51:18,410 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 04:51:18,411 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 04:51:18,412 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/UAutomizer-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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 04:51:18,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 04:51:18,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 04:51:18,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 04:51:18,680 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 04:51:18,681 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 04:51:18,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-05-04 04:51:18,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2dc8fd8/4e405ffe71ce4218ba0b8b81baf91765/FLAGe0a0ed5d8 [2023-05-04 04:51:19,226 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 04:51:19,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-05-04 04:51:19,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2dc8fd8/4e405ffe71ce4218ba0b8b81baf91765/FLAGe0a0ed5d8 [2023-05-04 04:51:19,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa2dc8fd8/4e405ffe71ce4218ba0b8b81baf91765 [2023-05-04 04:51:19,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 04:51:19,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 04:51:19,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 04:51:19,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 04:51:19,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 04:51:19,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:51:19" (1/1) ... [2023-05-04 04:51:19,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@929aba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:19, skipping insertion in model container [2023-05-04 04:51:19,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:51:19" (1/1) ... [2023-05-04 04:51:19,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 04:51:19,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 04:51:20,117 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/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-05-04 04:51:20,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:51:20,128 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 04:51:20,165 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/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-05-04 04:51:20,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:51:20,203 INFO L208 MainTranslator]: Completed translation [2023-05-04 04:51:20,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20 WrapperNode [2023-05-04 04:51:20,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 04:51:20,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 04:51:20,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 04:51:20,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 04:51:20,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,267 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2023-05-04 04:51:20,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 04:51:20,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 04:51:20,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 04:51:20,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 04:51:20,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 04:51:20,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 04:51:20,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 04:51:20,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 04:51:20,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (1/1) ... [2023-05-04 04:51:20,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:51:20,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:51:20,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 04:51:20,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 04:51:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 04:51:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-05-04 04:51:20,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-05-04 04:51:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 04:51:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 04:51:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 04:51:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 04:51:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 04:51:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 04:51:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 04:51:20,383 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 04:51:20,538 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 04:51:20,540 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 04:51:20,814 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 04:51:20,898 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 04:51:20,901 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 04:51:20,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:51:20 BoogieIcfgContainer [2023-05-04 04:51:20,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 04:51:20,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 04:51:20,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 04:51:20,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 04:51:20,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 04:51:19" (1/3) ... [2023-05-04 04:51:20,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e6b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:51:20, skipping insertion in model container [2023-05-04 04:51:20,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:51:20" (2/3) ... [2023-05-04 04:51:20,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2e6b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:51:20, skipping insertion in model container [2023-05-04 04:51:20,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:51:20" (3/3) ... [2023-05-04 04:51:20,913 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-05-04 04:51:20,921 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 04:51:20,930 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 04:51:20,930 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 04:51:20,930 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 04:51:21,015 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 04:51:21,050 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:51:21,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:51:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:51:21,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 04:51:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 04:51:21,098 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:51:21,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-05-04 04:51:21,131 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6845da5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:51:21,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:51:21,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:51:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:51:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1821504446, now seen corresponding path program 1 times [2023-05-04 04:51:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:51:21,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881773631] [2023-05-04 04:51:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:51:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:51:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:51:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 04:51:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:51:21,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881773631] [2023-05-04 04:51:21,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881773631] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:51:21,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:51:21,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:51:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089473535] [2023-05-04 04:51:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:51:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:51:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:51:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:51:21,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:51:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:21,631 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:51:21,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:51:21,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:21,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 04:51:21,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:51:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:51:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1355680925, now seen corresponding path program 1 times [2023-05-04 04:51:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:51:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326256295] [2023-05-04 04:51:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:51:21,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:51:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:51:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 04:51:22,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:51:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326256295] [2023-05-04 04:51:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326256295] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:51:22,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:51:22,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-05-04 04:51:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946839101] [2023-05-04 04:51:22,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:51:22,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-04 04:51:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:51:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-04 04:51:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-05-04 04:51:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:22,827 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:51:22,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:51:22,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:22,827 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:51:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:51:23,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 04:51:23,341 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:51:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:51:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1465918279, now seen corresponding path program 1 times [2023-05-04 04:51:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:51:23,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573602288] [2023-05-04 04:51:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:51:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:51:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:51:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 04:51:24,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:51:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573602288] [2023-05-04 04:51:24,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573602288] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:51:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040436817] [2023-05-04 04:51:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:51:24,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:51:24,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:51:24,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:51:24,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 04:51:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:51:24,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 62 conjunts are in the unsatisfiable core [2023-05-04 04:51:24,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:51:25,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:51:25,366 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 04:51:25,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2023-05-04 04:51:25,414 INFO L356 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2023-05-04 04:51:25,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 103 [2023-05-04 04:51:25,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:51:25,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-05-04 04:51:25,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:51:25,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-05-04 04:51:25,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 53 [2023-05-04 04:51:25,601 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:51:25,604 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:51:25,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2023-05-04 04:51:25,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-05-04 04:51:25,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-05-04 04:51:26,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:51:26,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2023-05-04 04:51:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 04:51:26,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:51:47,588 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:52:43,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:43,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:52:43,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:43,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:52:44,059 INFO L356 Elim1Store]: treesize reduction 69, result has 50.0 percent of original size [2023-05-04 04:52:44,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 641 treesize of output 673 [2023-05-04 04:52:44,083 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 598 treesize of output 582 [2023-05-04 04:52:44,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:44,110 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 582 treesize of output 551 [2023-05-04 04:52:44,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:44,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 546 [2023-05-04 04:52:44,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:44,185 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 610 treesize of output 646 [2023-05-04 04:52:44,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:44,226 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 568 treesize of output 572 [2023-05-04 04:52:44,504 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 21 treesize of output 17 [2023-05-04 04:52:44,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:44,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2023-05-04 04:52:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 04:52:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040436817] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:52:44,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:52:44,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 32 [2023-05-04 04:52:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345274093] [2023-05-04 04:52:44,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:52:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 04:52:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:52:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 04:52:44,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=824, Unknown=31, NotChecked=0, Total=992 [2023-05-04 04:52:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:44,945 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:52:44,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.25) internal successors, (264), 32 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:52:44,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:44,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-05-04 04:52:53,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 04:52:53,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 04:52:53,517 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:52:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:52:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 934176458, now seen corresponding path program 1 times [2023-05-04 04:52:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:52:53,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461157643] [2023-05-04 04:52:53,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:52:53,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:52:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:52:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 166 proven. 11 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-05-04 04:52:54,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:52:54,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461157643] [2023-05-04 04:52:54,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461157643] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:52:54,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623689130] [2023-05-04 04:52:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:52:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:52:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:52:54,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:52:54,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 04:52:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:52:54,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 5 conjunts are in the unsatisfiable core [2023-05-04 04:52:54,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:52:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2023-05-04 04:52:54,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 04:52:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623689130] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:52:54,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 04:52:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-05-04 04:52:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609226785] [2023-05-04 04:52:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:52:54,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:52:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:52:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:52:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-05-04 04:52:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:54,576 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:52:54,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:52:54,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:54,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:54,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-05-04 04:52:54,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-05-04 04:52:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:52:54,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 04:52:54,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:52:54,824 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:52:54,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:52:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -191318534, now seen corresponding path program 1 times [2023-05-04 04:52:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:52:54,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492369406] [2023-05-04 04:52:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:52:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:52:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:52:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 04:52:55,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:52:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492369406] [2023-05-04 04:52:55,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492369406] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:52:55,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337814457] [2023-05-04 04:52:55,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:52:55,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:52:55,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:52:55,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:52:55,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 04:52:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:52:55,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 04:52:55,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:52:55,846 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 04:52:55,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 04:52:55,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:52:55,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:52:55,877 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:52:55,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-05-04 04:52:55,881 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 5 treesize of output 3 [2023-05-04 04:52:56,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:52:56,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2023-05-04 04:52:56,021 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 11 treesize of output 7 [2023-05-04 04:52:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 04:52:56,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:52:56,059 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 6 treesize of output 4 [2023-05-04 04:52:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-05-04 04:52:56,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337814457] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 04:52:56,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 04:52:56,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 16 [2023-05-04 04:52:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205410061] [2023-05-04 04:52:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:52:56,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 04:52:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:52:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 04:52:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=199, Unknown=2, NotChecked=0, Total=240 [2023-05-04 04:52:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:56,075 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:52:56,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:52:56,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:56,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:56,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-05-04 04:52:56,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:52:56,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:52:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:52:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-05-04 04:52:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:52:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 04:52:57,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 04:52:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:52:57,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:52:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:52:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2038158131, now seen corresponding path program 2 times [2023-05-04 04:52:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:52:57,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35764043] [2023-05-04 04:52:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:52:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:52:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:52:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:52:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:52:58,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35764043] [2023-05-04 04:52:58,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35764043] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:52:58,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917576620] [2023-05-04 04:52:58,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:52:58,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:52:58,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:52:58,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:52:58,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 04:52:58,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 04:52:58,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:52:58,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 65 conjunts are in the unsatisfiable core [2023-05-04 04:52:58,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:52:58,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 04:52:58,576 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:52:58,577 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 [2023-05-04 04:52:58,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:52:58,714 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 14 treesize of output 16 [2023-05-04 04:52:59,015 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 04:52:59,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2023-05-04 04:52:59,063 INFO L356 Elim1Store]: treesize reduction 82, result has 27.4 percent of original size [2023-05-04 04:52:59,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 99 [2023-05-04 04:52:59,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:52:59,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-05-04 04:52:59,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-05-04 04:52:59,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:52:59,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:52:59,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-05-04 04:52:59,404 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 15 treesize of output 7 [2023-05-04 04:52:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:52:59,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:53:24,239 WARN L233 SmtUtils]: Spent 12.69s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:53:46,548 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (and (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse0 |c_~#top~0.offset|)) (forall ((v_ArrVal_519 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_10| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_10| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_519) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_10|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) is different from false [2023-05-04 04:53:48,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:53:48,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:53:48,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:53:48,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:53:48,781 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-05-04 04:53:48,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 637 treesize of output 623 [2023-05-04 04:53:48,789 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 603 treesize of output 587 [2023-05-04 04:53:48,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:53:48,803 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 587 treesize of output 572 [2023-05-04 04:53:49,008 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 6 treesize of output 4 [2023-05-04 04:53:49,016 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 24 treesize of output 22 [2023-05-04 04:53:49,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:53:49,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1171 treesize of output 1129 [2023-05-04 04:53:49,047 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 1114 treesize of output 1082 [2023-05-04 04:53:49,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:53:49,064 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 1082 treesize of output 1043 [2023-05-04 04:53:49,189 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 25 treesize of output 21 [2023-05-04 04:53:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:53:49,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917576620] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:53:49,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:53:49,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2023-05-04 04:53:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389236674] [2023-05-04 04:53:49,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:53:49,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 04:53:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:53:49,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 04:53:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1068, Unknown=41, NotChecked=68, Total=1332 [2023-05-04 04:53:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:49,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:53:49,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.297297297297297) internal successors, (159), 37 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 04:53:49,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:53:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-05-04 04:53:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:53:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:53:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 04:53:50,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 04:53:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:53:50,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:53:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:53:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1298958328, now seen corresponding path program 1 times [2023-05-04 04:53:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:53:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128236651] [2023-05-04 04:53:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:53:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:53:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:53:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:53:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:53:51,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128236651] [2023-05-04 04:53:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128236651] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:53:51,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174854856] [2023-05-04 04:53:51,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:53:51,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:53:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:53:51,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:53:51,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 04:53:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:53:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 51 conjunts are in the unsatisfiable core [2023-05-04 04:53:51,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:53:51,668 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:53:51,668 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 [2023-05-04 04:53:51,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 14 treesize of output 16 [2023-05-04 04:53:52,012 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 04:53:52,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 04:53:52,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:53:52,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:53:52,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:53:52,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:53:52,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-05-04 04:53:52,052 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 5 treesize of output 3 [2023-05-04 04:53:52,094 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 15 treesize of output 7 [2023-05-04 04:53:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:53:52,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:53:52,174 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 6 treesize of output 4 [2023-05-04 04:53:52,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_593 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_593) |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread1of1ForFork0_push_#t~mem6#1|)) is different from false [2023-05-04 04:53:52,230 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 18 treesize of output 14 [2023-05-04 04:53:52,312 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 04:53:52,312 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 [2023-05-04 04:53:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-05-04 04:53:52,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174854856] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:53:52,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:53:52,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2023-05-04 04:53:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840743085] [2023-05-04 04:53:52,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:53:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 04:53:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:53:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 04:53:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1051, Unknown=1, NotChecked=66, Total=1260 [2023-05-04 04:53:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:52,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:53:52,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.305555555555555) internal successors, (191), 36 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) [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 04:53:52,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:53:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:53:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-05-04 04:53:55,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-04 04:53:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:53:55,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:53:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:53:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1249218895, now seen corresponding path program 2 times [2023-05-04 04:53:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:53:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397060287] [2023-05-04 04:53:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:53:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:53:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:53:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:53:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:53:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397060287] [2023-05-04 04:53:56,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397060287] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:53:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776286968] [2023-05-04 04:53:56,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:53:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:53:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:53:56,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:53:56,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 04:53:56,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:53:56,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:53:56,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 95 conjunts are in the unsatisfiable core [2023-05-04 04:53:56,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:53:56,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 04:53:56,724 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:53:56,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:53:56,783 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:53:56,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:53:56,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:53:56,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-05-04 04:53:57,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 04:53:57,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 04:53:57,247 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:53:57,247 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 [2023-05-04 04:53:57,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:53:57,407 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 14 treesize of output 16 [2023-05-04 04:53:57,746 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 04:53:57,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 75 [2023-05-04 04:53:57,795 INFO L356 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2023-05-04 04:53:57,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 104 [2023-05-04 04:53:57,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:53:57,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:53:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:53:57,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-05-04 04:53:57,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 141 [2023-05-04 04:53:58,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:53:58,004 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:53:58,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 12 [2023-05-04 04:53:58,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-05-04 04:53:58,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2023-05-04 04:53:58,690 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-05-04 04:53:58,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 41 [2023-05-04 04:53:58,697 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 12 treesize of output 8 [2023-05-04 04:53:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:53:58,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:54:00,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_706 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| v_ArrVal_706) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_708 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_708) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) is different from false [2023-05-04 04:54:02,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_706 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| v_ArrVal_706) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_708 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_708) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) is different from false [2023-05-04 04:54:04,838 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse1 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_706 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| v_ArrVal_706) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_ArrVal_708 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_708) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_15|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2023-05-04 04:54:14,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:54:14,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:54:14,084 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 4502 treesize of output 4470 [2023-05-04 04:54:14,107 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 4470 treesize of output 4342 [2023-05-04 04:54:14,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,138 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 4342 treesize of output 4159 [2023-05-04 04:54:14,161 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 4150 treesize of output 4118 [2023-05-04 04:54:14,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,193 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 4124 treesize of output 3970 [2023-05-04 04:54:14,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1166 treesize of output 1124 [2023-05-04 04:54:14,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:14,565 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 1110 treesize of output 1071 [2023-05-04 04:54:14,578 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 1062 treesize of output 1030 [2023-05-04 04:54:14,669 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 5 treesize of output 3 [2023-05-04 04:54:15,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:15,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:54:15,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:54:15,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:54:15,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-05-04 04:54:15,068 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 5 treesize of output 3 [2023-05-04 04:54:15,072 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 21 treesize of output 13 [2023-05-04 04:54:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 17 refuted. 6 times theorem prover too weak. 3 trivial. 7 not checked. [2023-05-04 04:54:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776286968] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:54:15,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:54:15,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 56 [2023-05-04 04:54:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085674458] [2023-05-04 04:54:15,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:54:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-05-04 04:54:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:54:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-05-04 04:54:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2357, Unknown=47, NotChecked=312, Total=3080 [2023-05-04 04:54:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:54:15,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:54:15,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.392857142857143) internal successors, (246), 56 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-05-04 04:54:15,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:54:55,376 WARN L233 SmtUtils]: Spent 39.61s on a formula simplification. DAG size of input: 76 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:55:10,235 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 76 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:55:18,358 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 74 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:55:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-05-04 04:55:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 04:55:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 04:55:25,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:25,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:25,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash 679037134, now seen corresponding path program 2 times [2023-05-04 04:55:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:25,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19272622] [2023-05-04 04:55:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:55:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19272622] [2023-05-04 04:55:27,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19272622] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:27,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114675084] [2023-05-04 04:55:27,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:55:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:27,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:27,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 04:55:27,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:55:27,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:55:27,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 86 conjunts are in the unsatisfiable core [2023-05-04 04:55:27,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:27,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 04:55:27,557 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:55:27,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:55:27,608 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:55:27,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:55:27,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:55:27,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-05-04 04:55:27,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 04:55:27,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-05-04 04:55:28,021 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:55:28,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:55:28,034 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:55:28,034 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 [2023-05-04 04:55:28,227 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 04:55:28,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 04:55:28,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:28,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:28,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-05-04 04:55:28,282 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 5 treesize of output 3 [2023-05-04 04:55:28,350 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 14 treesize of output 16 [2023-05-04 04:55:28,389 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 15 treesize of output 7 [2023-05-04 04:55:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 04:55:28,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:28,531 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_828 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0) (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_829) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_830) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)))) is different from false [2023-05-04 04:55:28,585 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_829) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_830) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_828 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) is different from false [2023-05-04 04:55:28,591 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 6 treesize of output 4 [2023-05-04 04:55:28,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:28,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:55:28,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:28,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:55:28,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-05-04 04:55:28,924 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 5 treesize of output 3 [2023-05-04 04:55:28,926 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 21 treesize of output 13 [2023-05-04 04:55:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2023-05-04 04:55:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114675084] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:55:29,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:55:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 16] total 54 [2023-05-04 04:55:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013752415] [2023-05-04 04:55:29,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:55:29,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-05-04 04:55:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-05-04 04:55:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2386, Unknown=3, NotChecked=202, Total=2862 [2023-05-04 04:55:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:29,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:29,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 04:55:29,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:31,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_829) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_830) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)) (forall ((v_ArrVal_826 Int) (v_ArrVal_825 Int)) (not (= 0 (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_825) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_826) |c_ULTIMATE.start_main_~#t~0#1.base|)))) (or .cse0 (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_828 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) is different from false [2023-05-04 04:55:31,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_828 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0) (forall ((v_ArrVal_826 Int) (v_ArrVal_825 Int)) (not (= 0 (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_825) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_826) |c_ULTIMATE.start_main_~#t~0#1.base|)))) (or (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_829 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_829) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_830) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_833) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)))) is different from false [2023-05-04 04:55:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 04:55:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-04 04:55:32,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:32,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-05-04 04:55:32,301 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:32,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -928693915, now seen corresponding path program 3 times [2023-05-04 04:55:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:32,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165923645] [2023-05-04 04:55:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 04:55:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165923645] [2023-05-04 04:55:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165923645] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350400728] [2023-05-04 04:55:33,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 04:55:33,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:33,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:33,160 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:33,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 04:55:33,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-05-04 04:55:33,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:55:33,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 51 conjunts are in the unsatisfiable core [2023-05-04 04:55:33,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:33,324 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:55:33,326 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 [2023-05-04 04:55:33,893 INFO L356 Elim1Store]: treesize reduction 38, result has 47.9 percent of original size [2023-05-04 04:55:33,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 79 [2023-05-04 04:55:33,942 INFO L356 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2023-05-04 04:55:33,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 97 [2023-05-04 04:55:33,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:34,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:34,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-05-04 04:55:34,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2023-05-04 04:55:34,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 191 [2023-05-04 04:55:34,456 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-05-04 04:55:34,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-05-04 04:55:34,475 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-05-04 04:55:34,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,506 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 11 treesize of output 9 [2023-05-04 04:55:34,518 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2023-05-04 04:55:34,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:34,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 3 [2023-05-04 04:55:34,681 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-05-04 04:55:34,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 30 [2023-05-04 04:55:34,716 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-05-04 04:55:34,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 51 [2023-05-04 04:55:34,733 INFO L356 Elim1Store]: treesize reduction 40, result has 14.9 percent of original size [2023-05-04 04:55:34,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2023-05-04 04:55:34,761 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-05-04 04:55:34,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 19 [2023-05-04 04:55:34,918 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-05-04 04:55:34,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-05-04 04:55:35,043 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 04:55:35,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2023-05-04 04:55:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 04:55:35,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:36,400 INFO L356 Elim1Store]: treesize reduction 38, result has 56.8 percent of original size [2023-05-04 04:55:36,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 99 [2023-05-04 04:55:36,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:36,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2023-05-04 04:55:36,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:36,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 228 treesize of output 240 [2023-05-04 04:55:36,449 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 188 treesize of output 176 [2023-05-04 04:55:36,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:36,468 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 183 treesize of output 187 [2023-05-04 04:55:40,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:40,814 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 24 treesize of output 42 [2023-05-04 04:55:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 23 refuted. 6 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 04:55:40,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350400728] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:55:40,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:55:40,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 36 [2023-05-04 04:55:40,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92340731] [2023-05-04 04:55:40,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:55:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 04:55:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 04:55:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1006, Unknown=72, NotChecked=0, Total=1260 [2023-05-04 04:55:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:40,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.722222222222222) internal successors, (206), 36 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:40,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:40,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:40,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-04 04:55:40,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-05-04 04:55:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 04:55:45,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 04:55:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:45,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 04:55:45,637 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2023-05-04 04:55:45,638 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2023-05-04 04:55:45,641 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:45,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:55:45,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:45,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 04:55:45,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-05-04 04:55:45,652 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:55:45,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 04:55:45,654 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6845da5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:45,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:55:45,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1089364609, now seen corresponding path program 1 times [2023-05-04 04:55:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:45,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979435533] [2023-05-04 04:55:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:55:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:45,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979435533] [2023-05-04 04:55:45,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979435533] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:55:45,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:55:45,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:55:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668855565] [2023-05-04 04:55:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:55:45,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:55:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:55:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:55:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 04:55:45,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:45,764 INFO L85 PathProgramCache]: Analyzing trace with hash -89080491, now seen corresponding path program 1 times [2023-05-04 04:55:45,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:45,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136522792] [2023-05-04 04:55:45,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:45,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 04:55:45,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 04:55:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 04:55:45,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 04:55:45,802 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 04:55:45,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-05-04 04:55:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 04:55:45,806 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2023-05-04 04:55:45,806 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-05-04 04:55:45,807 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 04:55:45,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 04:55:45,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 04:55:45,840 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:45,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:55:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:45,842 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 04:55:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Waiting until timeout for monitored process [2023-05-04 04:55:45,851 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:55:45,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 04:55:45,855 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6845da5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:45,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:55:45,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1412334683, now seen corresponding path program 1 times [2023-05-04 04:55:45,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:45,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835543786] [2023-05-04 04:55:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:45,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835543786] [2023-05-04 04:55:45,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835543786] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:55:45,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:55:45,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:55:45,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904005193] [2023-05-04 04:55:45,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:55:45,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:55:45,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:55:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:55:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:45,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:45,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:45,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 04:55:46,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:46,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2094463237, now seen corresponding path program 1 times [2023-05-04 04:55:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:46,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822262753] [2023-05-04 04:55:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822262753] [2023-05-04 04:55:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822262753] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954929267] [2023-05-04 04:55:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:46,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:46,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:46,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 04:55:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:46,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-04 04:55:46,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:46,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:55:46,480 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 15 treesize of output 7 [2023-05-04 04:55:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 04:55:46,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:46,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:46,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 04:55:46,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:46,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 04:55:46,541 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 6 treesize of output 4 [2023-05-04 04:55:46,548 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 22 treesize of output 14 [2023-05-04 04:55:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954929267] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:55:46,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:55:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 10 [2023-05-04 04:55:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710030511] [2023-05-04 04:55:46,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:55:46,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 04:55:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 04:55:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-05-04 04:55:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,637 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:46,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:46,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:46,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:55:46,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:46,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-04 04:55:46,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1844930965, now seen corresponding path program 1 times [2023-05-04 04:55:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:46,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042264600] [2023-05-04 04:55:46,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:47,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042264600] [2023-05-04 04:55:47,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042264600] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:47,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233846272] [2023-05-04 04:55:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:47,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:47,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:47,113 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:47,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-04 04:55:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:47,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 21 conjunts are in the unsatisfiable core [2023-05-04 04:55:47,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:47,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 04:55:47,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:55:47,395 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 15 treesize of output 7 [2023-05-04 04:55:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:47,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:47,425 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 6 treesize of output 4 [2023-05-04 04:55:47,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:47,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2023-05-04 04:55:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-04 04:55:47,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233846272] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:55:47,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:55:47,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2023-05-04 04:55:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205611637] [2023-05-04 04:55:47,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:55:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:55:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:55:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:55:47,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:47,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:47,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 12 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:47,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:47,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:55:47,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:55:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:55:47,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:47,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-05-04 04:55:47,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:55:47,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash -188950531, now seen corresponding path program 1 times [2023-05-04 04:55:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:47,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106879231] [2023-05-04 04:55:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 04:55:47,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 04:55:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 04:55:47,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 04:55:47,963 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 04:55:47,963 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-05-04 04:55:47,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-05-04 04:55:47,964 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-05-04 04:55:47,964 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-05-04 04:55:47,964 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 04:55:47,965 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-05-04 04:55:47,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 04:55:47,994 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:47,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:55:47,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:47,996 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 04:55:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2023-05-04 04:55:48,002 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:55:48,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-05-04 04:55:48,004 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6845da5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:55:48,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:55:48,380 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash -688423921, now seen corresponding path program 1 times [2023-05-04 04:55:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:48,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391845400] [2023-05-04 04:55:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 04:55:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391845400] [2023-05-04 04:55:48,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391845400] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:55:48,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:55:48,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:55:48,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287891254] [2023-05-04 04:55:48,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:55:48,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:55:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:48,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:55:48,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:55:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:48,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:48,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-05-04 04:55:48,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2114066782, now seen corresponding path program 1 times [2023-05-04 04:55:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:48,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317312084] [2023-05-04 04:55:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-05-04 04:55:48,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317312084] [2023-05-04 04:55:48,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317312084] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:55:48,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:55:48,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 04:55:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636374832] [2023-05-04 04:55:48,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:55:48,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:55:48,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:48,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:55:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 04:55:48,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:48,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:48,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-04 04:55:48,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 546271330, now seen corresponding path program 1 times [2023-05-04 04:55:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283928547] [2023-05-04 04:55:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 04:55:49,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:49,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283928547] [2023-05-04 04:55:49,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283928547] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:49,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764000334] [2023-05-04 04:55:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:49,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:49,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:49,518 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:49,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-04 04:55:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:49,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 04:55:49,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:50,173 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 04:55:50,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 04:55:50,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:50,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-05-04 04:55:50,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:55:50,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-05-04 04:55:50,240 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 5 treesize of output 3 [2023-05-04 04:55:50,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:50,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2023-05-04 04:55:50,347 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 11 treesize of output 7 [2023-05-04 04:55:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-05-04 04:55:50,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:50,388 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 6 treesize of output 4 [2023-05-04 04:55:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-05-04 04:55:50,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764000334] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:50,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 04:55:50,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 15 [2023-05-04 04:55:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075496544] [2023-05-04 04:55:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:55:50,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 04:55:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:50,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 04:55:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-05-04 04:55:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:50,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.5) internal successors, (147), 6 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:50,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:50,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:50,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:50,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-04 04:55:50,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:50,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:55:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:55:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1587741172, now seen corresponding path program 2 times [2023-05-04 04:55:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:55:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122329260] [2023-05-04 04:55:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:55:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:55:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:55:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 04:55:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:55:51,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122329260] [2023-05-04 04:55:51,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122329260] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:55:51,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868796744] [2023-05-04 04:55:51,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:55:51,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:55:51,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:55:51,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:55:51,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-04 04:55:51,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:55:51,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:55:51,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 21 conjunts are in the unsatisfiable core [2023-05-04 04:55:51,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:55:51,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 04:55:51,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:55:51,401 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 15 treesize of output 7 [2023-05-04 04:55:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 04:55:51,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:55:51,434 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 6 treesize of output 4 [2023-05-04 04:55:51,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:55:51,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2023-05-04 04:55:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 04:55:51,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868796744] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:55:51,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:55:51,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2023-05-04 04:55:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821160862] [2023-05-04 04:55:51,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:55:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:55:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:55:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:55:51,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:55:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:51,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:55:51,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.75) internal successors, (189), 12 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 04:55:51,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:55:51,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:55:51,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:55:51,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:56:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:56:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:56:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 04:56:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:56:13,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-05-04 04:56:14,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:56:14,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:56:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:56:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1012660400, now seen corresponding path program 1 times [2023-05-04 04:56:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:56:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062526907] [2023-05-04 04:56:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:56:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:56:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:56:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 04:56:17,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:56:17,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062526907] [2023-05-04 04:56:17,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062526907] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:56:17,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688458682] [2023-05-04 04:56:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:56:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:56:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:56:17,653 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:56:17,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-04 04:56:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:56:17,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 252 conjunts are in the unsatisfiable core [2023-05-04 04:56:17,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:56:18,058 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:56:18,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:56:18,334 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-05-04 04:56:18,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-05-04 04:56:18,461 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-05-04 04:56:18,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2023-05-04 04:56:18,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 04:56:19,109 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-05-04 04:56:19,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2023-05-04 04:56:19,606 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2023-05-04 04:56:19,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2023-05-04 04:56:19,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-05-04 04:56:20,517 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 04:56:20,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-05-04 04:56:27,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:56:27,953 INFO L356 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2023-05-04 04:56:27,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2023-05-04 04:56:30,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:56:31,025 INFO L356 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2023-05-04 04:56:31,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 53 [2023-05-04 04:56:31,346 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 04:56:31,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 17 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-05-04 04:56:34,591 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-05-04 04:56:34,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 47 [2023-05-04 04:56:34,616 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-05-04 04:56:34,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2023-05-04 04:56:35,144 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-05-04 04:56:35,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 48 [2023-05-04 04:56:41,823 INFO L356 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2023-05-04 04:56:41,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 90 treesize of output 120 [2023-05-04 04:56:41,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 85 [2023-05-04 04:56:41,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-05-04 04:56:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 04:56:44,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:56:51,636 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (let ((.cse25 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse25 |c_~#top~0.offset|)))) (and (or .cse0 (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)))) (and (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse6 (select .cse5 |c_~#top~0.base|))) (let ((.cse1 (select .cse6 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| .cse1)) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store (store .cse5 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| (select (select .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse2 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select v_ArrVal_1686 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset|) 0)) (not (= .cse2 0)) (not (= (select (select (let ((.cse3 (store .cse4 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1686))) (store (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| (store (select (store .cse3 |c_~#top~0.base| v_ArrVal_1690) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse2 .cse1))))) (= (select (select .cse5 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0)))))) (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse9 (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse11 (store .cse12 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse8 (select (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select v_ArrVal_1686 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset|) 0)) (= .cse8 .cse9) (not (= (select (select (let ((.cse10 (store .cse11 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1686))) (store (store .cse10 |c_~#top~0.base| (store (select .cse10 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse10 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| (store (select (store .cse10 |c_~#top~0.base| v_ArrVal_1690) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= .cse8 0)))))) (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| .cse9) (= (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0)))))))) (or (not .cse0) (let ((.cse19 (store |c_#memory_int| |c_~#top~0.base| (store .cse25 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (and (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse17 (store (store .cse19 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (let ((.cse13 (select .cse18 |c_~#top~0.offset|))) (or (not (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| .cse13)) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse16 (store (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| (select (select .cse17 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse14 (select (select .cse16 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= .cse14 0)) (not (= (select (select (let ((.cse15 (store .cse16 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1686))) (store (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse15 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| (store (select (store .cse15 |c_~#top~0.base| v_ArrVal_1690) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_ArrVal_1686 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset|) 0)) (= .cse14 .cse13))))) (= (select (select .cse17 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0)))))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse24 (store (store .cse19 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse23 (select (select .cse24 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse21 (store .cse24 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse22 (select (select .cse21 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select v_ArrVal_1686 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (let ((.cse20 (store .cse21 |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1686))) (store (store .cse20 |c_~#top~0.base| (store (select .cse20 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse20 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base| (store (select (store .cse20 |c_~#top~0.base| v_ArrVal_1690) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse22 .cse23) (not (= .cse22 0)))))) (= |c_thr1Thread1of3ForFork0_push_~oldTop~0#1| .cse23) (= (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0)))))))))))) is different from false [2023-05-04 04:57:07,968 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 321 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:57:24,458 WARN L233 SmtUtils]: Spent 13.26s on a formula simplification that was a NOOP. DAG size: 340 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:57:44,148 WARN L233 SmtUtils]: Spent 10.96s on a formula simplification that was a NOOP. DAG size: 341 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:58:17,162 WARN L233 SmtUtils]: Spent 19.01s on a formula simplification that was a NOOP. DAG size: 359 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:58:53,152 WARN L233 SmtUtils]: Spent 18.60s on a formula simplification that was a NOOP. DAG size: 359 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 04:59:30,753 WARN L233 SmtUtils]: Spent 17.52s on a formula simplification that was a NOOP. DAG size: 342 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 05:00:10,412 WARN L233 SmtUtils]: Spent 17.43s on a formula simplification that was a NOOP. DAG size: 336 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 05:01:12,317 WARN L233 SmtUtils]: Spent 20.23s on a formula simplification that was a NOOP. DAG size: 338 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 05:01:19,281 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse72 (< 64 c_~next_alloc_idx~0))) (and (or (let ((.cse37 (< 62 c_~next_alloc_idx~0)) (.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (and (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse0 (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse1 (store .cse7 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (or (= (select v_ArrVal_1668 0) 0) (= .cse0 (select (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset|)) (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse6 (store (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse2 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse0 .cse2) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse4 (store .cse6 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse5 (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select (let ((.cse3 (store .cse4 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse3 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_ArrVal_1686 0) 0)) (not (= .cse5 0)) (= .cse5 .cse2))))) (= (select (select .cse6 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0))))))))))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse17 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse16 (store .cse17 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (let ((.cse9 (select (select .cse17 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse10 (select .cse16 |c_~#top~0.base|))) (or (not (= .cse9 (select .cse10 |c_~#top~0.offset|))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse15 (store (store (store .cse16 |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| (select (select .cse16 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse12 (select (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse14 (store .cse15 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse11 (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse11 .cse12) (not (= .cse11 0)) (not (= (select v_ArrVal_1686 0) 0)) (not (= (select (select (let ((.cse13 (store .cse14 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse13 |c_~#top~0.base| (store (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse13 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse13 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (= .cse9 .cse12) (= (select (select .cse15 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0))))) (= (select v_ArrVal_1668 0) 0)))))) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)))) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse27 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse26 (store .cse27 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (let ((.cse18 (select (select .cse27 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse19 (select .cse26 |c_~#top~0.base|))) (or (not (= .cse18 (select .cse19 |c_~#top~0.offset|))) (= (select v_ArrVal_1668 0) 0) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse24 (store (store (store .cse26 |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| (select (select .cse26 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse25 (select .cse24 |c_~#top~0.base|))) (let ((.cse20 (select .cse25 |c_~#top~0.offset|))) (or (not (= .cse18 .cse20)) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse23 (store (store .cse24 |c_~#top~0.base| (store .cse25 |c_~#top~0.offset| (select (select .cse24 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse21 (select (select .cse23 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse21 .cse20) (not (= 0 (select (select (let ((.cse22 (store .cse23 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse22 |c_~#top~0.base| (store (select .cse22 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse22 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse22 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|))) (not (= .cse21 0)) (not (= (select v_ArrVal_1686 0) 0)))))) (= (select (select .cse24 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0))))))))))))) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse36 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse34 (select (select .cse36 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse35 (store .cse36 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (or (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse32 (store (store .cse35 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse35 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse33 (select .cse32 |c_~#top~0.base|))) (let ((.cse29 (select .cse33 |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse31 (store (store .cse32 |c_~#top~0.base| (store .cse33 |c_~#top~0.offset| (select (select .cse32 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse28 (select (select .cse31 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= .cse28 0)) (= .cse29 .cse28) (not (= (select v_ArrVal_1686 0) 0)) (not (= (select (select (let ((.cse30 (store .cse31 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse30 |c_~#top~0.base| (store (select .cse30 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse30 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse30 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (= (select (select .cse32 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (not (= .cse34 .cse29))))))) (= (select v_ArrVal_1668 0) 0) (= .cse34 (select (select .cse35 |c_~#top~0.base|) |c_~#top~0.offset|)))))))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))))) (not .cse37)) (let ((.cse45 (+ c_~next_alloc_idx~0 2))) (or .cse37 (and (forall ((v_ArrVal_1677 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int) (v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int) (v_ArrVal_1681 (Array Int Int))) (let ((.cse43 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse42 (store .cse43 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store (select .cse43 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0 .cse45)))) (let ((.cse38 (store (store .cse42 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse42 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse44 (select .cse38 |c_~#top~0.base|))) (let ((.cse39 (select .cse44 |c_~#top~0.offset|)) (.cse40 (select (select (store (store .cse38 |c_~#top~0.base| (store .cse44 |c_~#top~0.offset| (select (select .cse38 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681) |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse41 (select (select .cse43 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (= (select (select .cse38 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (= .cse39 .cse40) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (= .cse39 .cse41)) (not (= .cse40 0)) (= (select (select .cse42 |c_~#top~0.base|) |c_~#top~0.offset|) .cse41) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))))))))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse54 (store .cse55 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store (select .cse55 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0 .cse45)))) (let ((.cse47 (select (select .cse55 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse46 (select .cse54 |c_~#top~0.base|))) (or (not (= (select .cse46 |c_~#top~0.offset|) .cse47)) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse48 (store (store (store .cse54 |c_~#top~0.base| (store .cse46 |c_~#top~0.offset| (select (select .cse54 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse53 (select .cse48 |c_~#top~0.base|))) (let ((.cse49 (select .cse53 |c_~#top~0.offset|))) (or (= (select (select .cse48 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (not (= .cse47 .cse49)) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse52 (store (store .cse48 |c_~#top~0.base| (store .cse53 |c_~#top~0.offset| (select (select .cse48 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse50 (select (select .cse52 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= .cse50 0)) (= .cse49 .cse50) (not (= (select v_ArrVal_1686 0) 0)) (not (= (select (select (let ((.cse51 (store .cse52 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse51 |c_~#top~0.base| (store (select .cse51 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse51 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse51 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))))) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)))) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))))))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (let ((.cse64 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse63 (store .cse64 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store (select .cse64 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0 .cse45)))) (let ((.cse57 (select (select .cse64 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse56 (select .cse63 |c_~#top~0.base|))) (or (not (= (select .cse56 |c_~#top~0.offset|) .cse57)) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse58 (store (store (store .cse63 |c_~#top~0.base| (store .cse56 |c_~#top~0.offset| (select (select .cse63 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse62 (select (select .cse58 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse58 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse60 (store .cse58 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse61 (select (select .cse60 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select (let ((.cse59 (store .cse60 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse59 |c_~#top~0.base| (store (select .cse59 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse59 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse59 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_ArrVal_1686 0) 0)) (not (= .cse61 0)) (= .cse61 .cse62))))) (= .cse57 .cse62))))))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))))))) (forall ((v_ArrVal_1665 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (let ((.cse71 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse70 (store .cse71 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| (store (select .cse71 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0 .cse45))) (.cse69 (select (select .cse71 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse65 (store (store .cse70 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse70 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse68 (select (select .cse65 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= (select (select .cse65 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse67 (store .cse65 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (or (not (= (select v_ArrVal_1686 0) 0)) (not (= (select (select (let ((.cse66 (store .cse67 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse66 |c_~#top~0.base| (store (select .cse66 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse66 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse66 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse68 (select (select .cse67 |c_~#top~0.base|) |c_~#top~0.offset|))))) (= .cse68 .cse69))))))) (= (select (select .cse70 |c_~#top~0.base|) |c_~#top~0.offset|) .cse69) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))))))) (= .cse45 0))))) .cse72) (or (not .cse72) (and (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse81 (store .cse82 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (let ((.cse74 (select (select .cse82 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse73 (select .cse81 |c_~#top~0.base|))) (or (not (= (select .cse73 |c_~#top~0.offset|) .cse74)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse75 (store (store (store .cse81 |c_~#top~0.base| (store .cse73 |c_~#top~0.offset| (select (select .cse81 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse80 (select .cse75 |c_~#top~0.base|))) (let ((.cse79 (select .cse80 |c_~#top~0.offset|))) (or (= (select (select .cse75 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse77 (store (store .cse75 |c_~#top~0.base| (store .cse80 |c_~#top~0.offset| (select (select .cse75 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse78 (select (select .cse77 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= (select (select (let ((.cse76 (store .cse77 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse76 |c_~#top~0.base| (store (select .cse76 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse76 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse76 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_ArrVal_1686 0) 0)) (not (= .cse78 0)) (= .cse79 .cse78))))) (not (= .cse79 .cse74))))))) (= (select v_ArrVal_1668 0) 0)))))) (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse91 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse90 (store .cse91 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (let ((.cse84 (select (select .cse91 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse83 (select .cse90 |c_~#top~0.base|))) (or (not (= (select .cse83 |c_~#top~0.offset|) .cse84)) (= (select v_ArrVal_1668 0) 0) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (let ((.cse89 (store (store (store .cse90 |c_~#top~0.base| (store .cse83 |c_~#top~0.offset| (select (select .cse90 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse85 (select (select .cse89 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse88 (store .cse89 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse86 (select (select .cse88 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse85 .cse86) (not (= (select v_ArrVal_1686 0) 0)) (not (= .cse86 0)) (not (= (select (select (let ((.cse87 (store .cse88 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse87 |c_~#top~0.base| (store (select .cse87 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse87 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse87 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (= (select (select .cse89 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (= .cse85 .cse84)))))))))))) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse99 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse98 (store .cse99 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668)) (.cse92 (select (select .cse99 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse94 (store (store .cse98 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse98 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse93 (select (select .cse94 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (= .cse92 .cse93) (= (select (select .cse94 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (forall ((v_ArrVal_1678 (Array Int Int)) (v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse97 (store .cse94 |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1678))) (let ((.cse95 (select (select .cse97 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= .cse95 0)) (= .cse95 .cse93) (not (= (select v_ArrVal_1686 0) 0)) (not (= 0 (select (select (let ((.cse96 (store .cse97 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse96 |c_~#top~0.base| (store (select .cse96 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse96 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse96 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|))))))))))) (= (select (select .cse98 |c_~#top~0.base|) |c_~#top~0.offset|) .cse92) (= (select v_ArrVal_1668 0) 0))))))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))) (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| Int)) (or (forall ((|v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| Int)) (or (not (= (select (store |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| 1) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0)) (forall ((v_ArrVal_1668 (Array Int Int))) (let ((.cse108 (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1665))) (let ((.cse101 (select (select .cse108 |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse100 (store .cse108 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31| v_ArrVal_1668))) (or (= (select (select .cse100 |c_~#top~0.base|) |c_~#top~0.offset|) .cse101) (= (select v_ArrVal_1668 0) 0) (forall ((v_ArrVal_1677 (Array Int Int))) (let ((.cse106 (store (store .cse100 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse100 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1677))) (let ((.cse107 (select .cse106 |c_~#top~0.base|))) (let ((.cse105 (select .cse107 |c_~#top~0.offset|))) (or (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1690 (Array Int Int))) (let ((.cse104 (store (store .cse106 |c_~#top~0.base| (store .cse107 |c_~#top~0.offset| (select (select .cse106 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.base| v_ArrVal_1681))) (let ((.cse102 (select (select .cse104 |c_~#top~0.base|) |c_~#top~0.offset|))) (or (not (= .cse102 0)) (not (= (select v_ArrVal_1686 0) 0)) (not (= (select (select (let ((.cse103 (store .cse104 |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| v_ArrVal_1686))) (store (store .cse103 |c_~#top~0.base| (store (select .cse103 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse103 |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|) 0))) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25| (store (select (store .cse103 |c_~#top~0.base| v_ArrVal_1690) |v_thr1Thread3of3ForFork0_push_~#ret~0#1.base_25|) 0 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= .cse102 .cse105))))) (= (select (select .cse106 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset|) 0) (not (= .cse101 .cse105))))))))))))) (not (= 0 (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|))) (not (< |c_#StackHeapBarrier| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_31|)))))))) is different from true [2023-05-04 05:01:36,830 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-05-04 05:01:36,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2023-05-04 05:01:36,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-05-04 05:01:37,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:01:37,069 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 46 more [2023-05-04 05:01:37,072 INFO L158 Benchmark]: Toolchain (without parser) took 617306.95ms. Allocated memory was 200.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 167.5MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 05:01:37,072 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 05:01:37,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.34ms. Allocated memory was 200.3MB in the beginning and 307.2MB in the end (delta: 107.0MB). Free memory was 167.3MB in the beginning and 264.8MB in the end (delta: -97.5MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-05-04 05:01:37,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.33ms. Allocated memory is still 307.2MB. Free memory was 264.8MB in the beginning and 262.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 05:01:37,072 INFO L158 Benchmark]: Boogie Preprocessor took 26.15ms. Allocated memory is still 307.2MB. Free memory was 262.8MB in the beginning and 261.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 05:01:37,073 INFO L158 Benchmark]: RCFGBuilder took 608.13ms. Allocated memory is still 307.2MB. Free memory was 261.2MB in the beginning and 241.8MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-04 05:01:37,073 INFO L158 Benchmark]: TraceAbstraction took 616164.91ms. Allocated memory was 307.2MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 240.7MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 05:01:37,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 154.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.34ms. Allocated memory was 200.3MB in the beginning and 307.2MB in the end (delta: 107.0MB). Free memory was 167.3MB in the beginning and 264.8MB in the end (delta: -97.5MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.33ms. Allocated memory is still 307.2MB. Free memory was 264.8MB in the beginning and 262.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.15ms. Allocated memory is still 307.2MB. Free memory was 262.8MB in the beginning and 261.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 608.13ms. Allocated memory is still 307.2MB. Free memory was 261.2MB in the beginning and 241.8MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 616164.91ms. Allocated memory was 307.2MB in the beginning and 4.0GB in the end (delta: 3.7GB). Free memory was 240.7MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6391, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 465, dependent conditional: 410, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5994, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 68, dependent conditional: 13, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5994, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 68, dependent conditional: 13, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 110, dependent unconditional: 133, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 108, dependent unconditional: 135, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 108, dependent unconditional: 135, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1760, independent: 1654, independent conditional: 40, independent unconditional: 1614, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1760, independent: 1598, independent conditional: 0, independent unconditional: 1598, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 162, independent: 56, independent conditional: 40, independent unconditional: 16, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, independent: 56, independent conditional: 40, independent unconditional: 16, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 504, independent: 183, independent conditional: 96, independent unconditional: 87, dependent: 313, dependent conditional: 178, dependent unconditional: 136, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6169, independent: 4271, independent conditional: 24, independent unconditional: 4247, dependent: 138, dependent conditional: 58, dependent unconditional: 80, unknown: 1760, unknown conditional: 91, unknown unconditional: 1669] , Statistics on independence cache: Total cache size (in pairs): 1759, Positive cache size: 1654, Positive conditional cache size: 40, Positive unconditional cache size: 1614, Negative cache size: 105, Negative conditional cache size: 50, Negative unconditional cache size: 55, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 8, Independence queries for same thread: 397 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 444, Number of trivial persistent sets: 429, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2605, independent: 2550, independent conditional: 0, independent unconditional: 2550, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6391, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 465, dependent conditional: 410, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5994, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 68, dependent conditional: 13, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5994, independent: 5925, independent conditional: 3375, independent unconditional: 2550, dependent: 68, dependent conditional: 13, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 110, dependent unconditional: 133, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 108, dependent unconditional: 135, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6169, independent: 5925, independent conditional: 64, independent unconditional: 5861, dependent: 243, dependent conditional: 108, dependent unconditional: 135, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1760, independent: 1654, independent conditional: 40, independent unconditional: 1614, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1760, independent: 1598, independent conditional: 0, independent unconditional: 1598, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 162, independent: 56, independent conditional: 40, independent unconditional: 16, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, independent: 56, independent conditional: 40, independent unconditional: 16, dependent: 105, dependent conditional: 50, dependent unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 504, independent: 183, independent conditional: 96, independent unconditional: 87, dependent: 313, dependent conditional: 178, dependent unconditional: 136, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6169, independent: 4271, independent conditional: 24, independent unconditional: 4247, dependent: 138, dependent conditional: 58, dependent unconditional: 80, unknown: 1760, unknown conditional: 91, unknown unconditional: 1669] , Statistics on independence cache: Total cache size (in pairs): 1759, Positive cache size: 1654, Positive conditional cache size: 40, Positive unconditional cache size: 1614, Negative cache size: 105, Negative conditional cache size: 50, Negative unconditional cache size: 55, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 8, Independence queries for same thread: 397 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1086, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 44, dependent conditional: 39, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 652, independent: 647, independent conditional: 0, independent unconditional: 647, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 652, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1047, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 652, unknown conditional: 0, unknown unconditional: 652] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 647, Positive conditional cache size: 0, Positive unconditional cache size: 647, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 39 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 46, Number of trivial persistent sets: 40, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1018, independent: 1013, independent conditional: 0, independent unconditional: 1013, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1086, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 44, dependent conditional: 39, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 29, independent unconditional: 1013, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1047, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 652, independent: 647, independent conditional: 0, independent unconditional: 647, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 652, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1047, independent: 395, independent conditional: 0, independent unconditional: 395, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 652, unknown conditional: 0, unknown unconditional: 652] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 647, Positive conditional cache size: 0, Positive unconditional cache size: 647, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 39 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6580, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 253, dependent conditional: 212, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6381, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 54, dependent conditional: 13, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6381, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 54, dependent conditional: 13, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 18, dependent unconditional: 54, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 15, dependent unconditional: 57, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 15, dependent unconditional: 57, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4056, independent: 4008, independent conditional: 0, independent unconditional: 4008, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4056, independent: 3988, independent conditional: 0, independent unconditional: 3988, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 140, dependent conditional: 9, dependent unconditional: 131, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Protected Queries: 0 ], Cache Queries: [ total: 6399, independent: 2318, independent conditional: 0, independent unconditional: 2318, dependent: 25, dependent conditional: 9, dependent unconditional: 16, unknown: 4056, unknown conditional: 6, unknown unconditional: 4050] , Statistics on independence cache: Total cache size (in pairs): 4055, Positive cache size: 4008, Positive conditional cache size: 0, Positive unconditional cache size: 4008, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 3, Maximal queried relation: 2, Independence queries for same thread: 199 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 103, Number of trivial persistent sets: 83, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5997, independent: 5955, independent conditional: 0, independent unconditional: 5955, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6580, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 253, dependent conditional: 212, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6381, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 54, dependent conditional: 13, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6381, independent: 6326, independent conditional: 371, independent unconditional: 5955, dependent: 54, dependent conditional: 13, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 18, dependent unconditional: 54, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 15, dependent unconditional: 57, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6399, independent: 6326, independent conditional: 0, independent unconditional: 6326, dependent: 72, dependent conditional: 15, dependent unconditional: 57, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4056, independent: 4008, independent conditional: 0, independent unconditional: 4008, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4056, independent: 3988, independent conditional: 0, independent unconditional: 3988, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 6, dependent unconditional: 41, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 140, dependent conditional: 9, dependent unconditional: 131, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Protected Queries: 0 ], Cache Queries: [ total: 6399, independent: 2318, independent conditional: 0, independent unconditional: 2318, dependent: 25, dependent conditional: 9, dependent unconditional: 16, unknown: 4056, unknown conditional: 6, unknown unconditional: 4050] , Statistics on independence cache: Total cache size (in pairs): 4055, Positive cache size: 4008, Positive conditional cache size: 0, Positive unconditional cache size: 4008, Negative cache size: 47, Negative conditional cache size: 6, Negative unconditional cache size: 41, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1, Eliminated conditions: 3, Maximal queried relation: 2, Independence queries for same thread: 199 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-04 05:01:37,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2023-05-04 05:01:37,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (12)] Forceful destruction successful, exit code 0 [2023-05-04 05:01:37,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Ended with exit code 0 [2023-05-04 05:01:37,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...