/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 11:50:30,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 11:50:30,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 11:50:30,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 11:50:30,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 11:50:30,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 11:50:30,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 11:50:30,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 11:50:30,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 11:50:30,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 11:50:30,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 11:50:30,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 11:50:30,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 11:50:30,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 11:50:30,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 11:50:30,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 11:50:30,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 11:50:30,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 11:50:30,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 11:50:30,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 11:50:30,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 11:50:30,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 11:50:30,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 11:50:30,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 11:50:30,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 11:50:30,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 11:50:30,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 11:50:30,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 11:50:30,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 11:50:30,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 11:50:30,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 11:50:30,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 11:50:30,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 11:50:30,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 11:50:30,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 11:50:30,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 11:50:30,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 11:50:30,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 11:50:30,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 11:50:30,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 11:50:30,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 11:50:30,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 11:50:30,605 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 11:50:30,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 11:50:30,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 11:50:30,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 11:50:30,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 11:50:30,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 11:50:30,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 11:50:30,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 11:50:30,607 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 11:50:30,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 11:50:30,608 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 11:50:30,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 11:50:30,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 11:50:30,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 11:50:30,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 11:50:30,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 11:50:30,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 11:50:30,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 11:50:30,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 11:50:30,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:50:30,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 11:50:30,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 11:50:30,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 11:50:30,612 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 11:50:30,612 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 11:50:30,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 11:50:30,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 11:50:30,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 11:50:30,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 11:50:30,613 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 11:50:30,613 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 -> X 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-20 11:50:30,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 11:50:30,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 11:50:30,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 11:50:30,887 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 11:50:30,889 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 11:50:30,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-05-20 11:50:30,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb07a750/2f6b2a29378841bfb4b9e283fa045f66/FLAG43cb6b22c [2023-05-20 11:50:31,335 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 11:50:31,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2023-05-20 11:50:31,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb07a750/2f6b2a29378841bfb4b9e283fa045f66/FLAG43cb6b22c [2023-05-20 11:50:31,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cb07a750/2f6b2a29378841bfb4b9e283fa045f66 [2023-05-20 11:50:31,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 11:50:31,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 11:50:31,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 11:50:31,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 11:50:31,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 11:50:31,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181aadcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31, skipping insertion in model container [2023-05-20 11:50:31,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 11:50:31,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 11:50:31,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2023-05-20 11:50:31,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:50:31,641 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 11:50:31,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2023-05-20 11:50:31,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:50:31,694 INFO L208 MainTranslator]: Completed translation [2023-05-20 11:50:31,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31 WrapperNode [2023-05-20 11:50:31,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 11:50:31,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 11:50:31,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 11:50:31,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 11:50:31,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,745 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2023-05-20 11:50:31,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 11:50:31,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 11:50:31,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 11:50:31,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 11:50:31,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,771 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 11:50:31,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 11:50:31,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 11:50:31,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 11:50:31,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (1/1) ... [2023-05-20 11:50:31,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:50:31,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:31,803 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-20 11:50:31,828 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-20 11:50:31,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 11:50:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 11:50:31,845 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 11:50:31,845 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 11:50:31,848 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 11:50:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 11:50:31,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 11:50:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 11:50:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 11:50:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 11:50:31,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 11:50:31,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 11:50:31,852 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 11:50:31,990 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 11:50:31,992 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 11:50:32,270 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 11:50:32,355 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 11:50:32,355 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-20 11:50:32,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:50:32 BoogieIcfgContainer [2023-05-20 11:50:32,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 11:50:32,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 11:50:32,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 11:50:32,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 11:50:32,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 11:50:31" (1/3) ... [2023-05-20 11:50:32,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2998cd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:50:32, skipping insertion in model container [2023-05-20 11:50:32,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:50:31" (2/3) ... [2023-05-20 11:50:32,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2998cd2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:50:32, skipping insertion in model container [2023-05-20 11:50:32,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:50:32" (3/3) ... [2023-05-20 11:50:32,371 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2023-05-20 11:50:32,379 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 11:50:32,386 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 11:50:32,386 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 11:50:32,386 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 11:50:32,455 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 11:50:32,499 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:50:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 11:50:32,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:32,501 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-20 11:50:32,532 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-20 11:50:32,549 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 11:50:32,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 11:50:32,577 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;@549e58ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:50:32,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-20 11:50:32,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1323795797, now seen corresponding path program 1 times [2023-05-20 11:50:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:32,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754146220] [2023-05-20 11:50:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-20 11:50:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:33,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754146220] [2023-05-20 11:50:33,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754146220] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 11:50:33,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 11:50:33,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 11:50:33,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972440646] [2023-05-20 11:50:33,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:50:33,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 11:50:33,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 11:50:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 11:50:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:33,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:33,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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-20 11:50:33,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:33,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 11:50:33,321 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:33,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash -719563594, now seen corresponding path program 1 times [2023-05-20 11:50:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:33,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481124524] [2023-05-20 11:50:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-20 11:50:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:33,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481124524] [2023-05-20 11:50:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481124524] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:33,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159750527] [2023-05-20 11:50:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:33,870 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-20 11:50:33,910 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-20 11:50:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:34,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 11:50:34,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-20 11:50:34,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-05-20 11:50:34,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159750527] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:50:34,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:50:34,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2023-05-20 11:50:34,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64393783] [2023-05-20 11:50:34,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:50:34,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-05-20 11:50:34,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:34,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-05-20 11:50:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-05-20 11:50:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:34,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:34,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.2) internal successors, (205), 25 states have internal predecessors, (205), 0 states have call successors, (0), 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-20 11:50:34,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:34,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:34,986 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-20 11:50:35,173 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,SelfDestructingSolverStorable1 [2023-05-20 11:50:35,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1686036596, now seen corresponding path program 1 times [2023-05-20 11:50:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:35,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89252211] [2023-05-20 11:50:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-20 11:50:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:35,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89252211] [2023-05-20 11:50:35,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89252211] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:35,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055850865] [2023-05-20 11:50:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:35,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:35,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:35,432 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-20 11:50:35,461 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-20 11:50:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:35,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 11:50:35,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-20 11:50:35,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-05-20 11:50:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055850865] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:35,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 11:50:35,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 11:50:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352062908] [2023-05-20 11:50:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:50:35,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 11:50:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:35,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 11:50:35,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 11:50:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:35,764 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:35,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 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-20 11:50:35,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:35,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:35,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:35,923 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-20 11:50:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:36,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:36,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 136261875, now seen corresponding path program 1 times [2023-05-20 11:50:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:36,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180723706] [2023-05-20 11:50:36,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180723706] [2023-05-20 11:50:36,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180723706] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:36,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101856199] [2023-05-20 11:50:36,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:36,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:36,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:36,336 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-20 11:50:36,354 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-20 11:50:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:36,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 11:50:36,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:36,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:36,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101856199] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:36,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 11:50:36,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-05-20 11:50:36,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854585601] [2023-05-20 11:50:36,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:50:36,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-05-20 11:50:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:36,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-05-20 11:50:36,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-05-20 11:50:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:36,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:36,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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-20 11:50:36,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:36,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:36,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:36,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:36,953 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-20 11:50:37,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:37,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 595371588, now seen corresponding path program 1 times [2023-05-20 11:50:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:37,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353420200] [2023-05-20 11:50:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:50:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353420200] [2023-05-20 11:50:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353420200] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500748797] [2023-05-20 11:50:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:38,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:38,868 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-20 11:50:38,891 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-20 11:50:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:38,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-20 11:50:38,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:39,051 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-20 11:50:39,104 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-05-20 11:50:39,104 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 12 treesize of output 18 [2023-05-20 11:50:39,569 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 11:50:39,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-05-20 11:50:39,853 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 15 treesize of output 11 [2023-05-20 11:50:40,479 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-20 11:50:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-05-20 11:50:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 11:50:41,241 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 35 treesize of output 33 [2023-05-20 11:50:41,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:50:41,460 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 63 treesize of output 43 [2023-05-20 11:50:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:50:42,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:44,198 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_143 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< ~M~0 c_~N~0)))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (< (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse2) (not (< .cse2 c_~min2~0)))))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse3) (not (< .cse3 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0) (not (< ~M~0 c_~N~0)))))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse5 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (not (< .cse5 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse6 c_~min2~0)) (= .cse5 .cse6))))))))) is different from false [2023-05-20 11:50:44,931 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse0 c_~min2~0)) (= .cse0 .cse1)))) (not (< .cse1 c_~min1~0)))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse3) (not (< .cse3 c_~min2~0))))) (< (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_143 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) (= c_~min2~0 .cse7) (not (< .cse7 c_~min1~0))))))) is different from false [2023-05-20 11:50:45,077 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (not (< .cse0 c_~min1~0)))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (= .cse3 c_~min1~0) (not (< .cse3 c_~min2~0)) (not (< ~M~0 c_~N~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_143 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= .cse5 .cse6)))) (not (< .cse6 c_~min1~0))))))) is different from false [2023-05-20 11:50:45,154 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse1 c_~min2~0)) (= .cse1 .cse0)))))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_143 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_143 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse6 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_144 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))) (= c_~min2~0 .cse6)))))) is different from false [2023-05-20 11:50:46,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:50:46,518 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2023-05-20 11:50:46,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:50:46,530 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 343 treesize of output 329 [2023-05-20 11:50:46,542 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 282 treesize of output 234 [2023-05-20 11:50:46,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:50:46,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 257 [2023-05-20 11:50:46,565 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 222 treesize of output 198 [2023-05-20 11:50:47,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:50:47,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-05-20 11:50:47,097 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 11:50:47,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 11:50:47,107 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-05-20 11:50:47,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2023-05-20 11:50:47,119 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-05-20 11:50:47,122 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 23 treesize of output 19 [2023-05-20 11:50:47,137 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 11:50:47,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2023-05-20 11:50:47,145 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 11:50:47,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2023-05-20 11:50:48,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 11:50:48,587 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 10 treesize of output 8 [2023-05-20 11:50:48,591 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 11:50:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:50:48,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500748797] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:50:48,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:50:48,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 31] total 76 [2023-05-20 11:50:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655974483] [2023-05-20 11:50:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:50:48,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-05-20 11:50:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:48,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-05-20 11:50:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=4600, Unknown=27, NotChecked=572, Total=5700 [2023-05-20 11:50:48,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:48,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:48,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.105263157894737) internal successors, (312), 76 states have internal predecessors, (312), 0 states have call successors, (0), 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-20 11:50:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:48,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:48,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-20 11:50:52,716 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-20 11:50:52,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:52,901 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1855120263, now seen corresponding path program 2 times [2023-05-20 11:50:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:52,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234185965] [2023-05-20 11:50:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:50:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234185965] [2023-05-20 11:50:53,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234185965] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77306406] [2023-05-20 11:50:53,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 11:50:53,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:53,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:53,144 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-20 11:50:53,145 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-20 11:50:53,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 11:50:53,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:50:53,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 11:50:53,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:50:53,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 11:50:53,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77306406] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:50:53,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:50:53,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-20 11:50:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795801436] [2023-05-20 11:50:53,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:50:53,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-20 11:50:53,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:53,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-20 11:50:53,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-20 11:50:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:53,618 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:53,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.833333333333333) internal successors, (188), 24 states have internal predecessors, (188), 0 states have call successors, (0), 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-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-20 11:50:53,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-20 11:50:54,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:50:54,092 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-20 11:50:54,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:54,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1379590337, now seen corresponding path program 3 times [2023-05-20 11:50:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:54,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810730060] [2023-05-20 11:50:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:54,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810730060] [2023-05-20 11:50:54,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810730060] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599925170] [2023-05-20 11:50:54,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 11:50:54,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:54,525 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-20 11:50:54,549 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-20 11:50:54,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 11:50:54,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:50:54,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 12 conjunts are in the unsatisfiable core [2023-05-20 11:50:54,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:50:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:54,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:50:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 11:50:55,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599925170] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:50:55,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:50:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2023-05-20 11:50:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600713144] [2023-05-20 11:50:55,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:50:55,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-20 11:50:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:50:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-20 11:50:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2023-05-20 11:50:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:55,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:50:55,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.62962962962963) internal successors, (206), 27 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-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:50:55,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:50:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 11:50:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 11:50:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-05-20 11:50:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-20 11:50:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-20 11:50:55,601 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-20 11:50:55,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:55,795 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 11:50:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:50:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1298077882, now seen corresponding path program 4 times [2023-05-20 11:50:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:50:55,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471208392] [2023-05-20 11:50:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:50:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:50:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:50:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:50:59,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:50:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471208392] [2023-05-20 11:50:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471208392] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:50:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556941039] [2023-05-20 11:50:59,469 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 11:50:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:50:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:50:59,470 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-20 11:50:59,471 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-20 11:50:59,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 11:50:59,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:50:59,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 54 conjunts are in the unsatisfiable core [2023-05-20 11:50:59,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:51:00,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 11:51:00,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-05-20 11:51:01,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 11:51:01,683 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 97 treesize of output 81 [2023-05-20 11:51:02,875 INFO L356 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2023-05-20 11:51:02,876 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 177 treesize of output 108 [2023-05-20 11:51:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:51:03,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:51:04,274 WARN L833 $PredicateComparison]: unable to prove that (or (<= (+ 3 c_~M~0) c_~N~0) (let ((.cse10 (* 4 c_~M~0))) (let ((.cse1 (+ c_~A~0.offset .cse10)) (.cse2 (+ c_~A~0.offset .cse10 4))) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_255 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base))) (or (< (select .cse0 .cse1) c_~min2~0) (< (select .cse0 .cse2) c_~min2~0))))) (forall ((v_ArrVal_255 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base))) (let ((.cse3 (select .cse4 .cse1))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3) (< (select .cse4 .cse2) .cse3))))) (forall ((v_ArrVal_255 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base))) (let ((.cse6 (select .cse5 .cse2))) (or (< (select .cse5 .cse1) c_~min2~0) (= c_~min1~0 .cse6) (not (< .cse6 c_~min2~0)))))) (forall ((v_ArrVal_255 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base))) (let ((.cse8 (select .cse9 .cse2)) (.cse7 (select .cse9 .cse1))) (or (not (< .cse7 c_~min2~0)) (= c_~min1~0 .cse8) (not (< .cse8 .cse7)))))))))) is different from false [2023-05-20 11:51:10,799 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse0 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse2 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse3 (* ~M~0 4))) (let ((.cse4 (select .cse2 (+ c_~A~0.offset .cse3)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse2 (+ c_~A~0.offset .cse3 4)) .cse4) (not (< .cse4 c_~min2~0)) (= c_~min1~0 .cse4)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse6 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse7 (* ~M~0 4))) (or (< (select (select .cse5 c_~A~0.base) .cse1) c_~min1~0) (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse6 (+ c_~A~0.offset .cse7 4)) c_~min2~0) (< (select .cse6 (+ c_~A~0.offset .cse7)) c_~min2~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse9 (select (select .cse13 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse11 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse12 (* ~M~0 4))) (let ((.cse8 (select .cse11 (+ c_~A~0.offset .cse12 4))) (.cse10 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (= .cse8 .cse9) (not (< .cse10 c_~min2~0)) (not (< .cse8 .cse10)))))) (not (< .cse9 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse15 (select (select .cse18 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse17 (* ~M~0 4))) (let ((.cse14 (select .cse16 (+ c_~A~0.offset .cse17 4)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse14 c_~min2~0)) (= .cse14 .cse15) (< (select .cse16 (+ c_~A~0.offset .cse17)) c_~min2~0))))) (not (< .cse15 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse19 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse22 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse23 (* ~M~0 4))) (let ((.cse20 (select .cse22 (+ c_~A~0.offset .cse23 4))) (.cse21 (select .cse22 (+ c_~A~0.offset .cse23)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse20) (< 0 ~M~0) (not (< .cse21 c_~min2~0)) (not (< .cse20 .cse21))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse27 (select (select .cse28 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse24 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse25 (* ~M~0 4))) (let ((.cse26 (select .cse24 (+ c_~A~0.offset .cse25)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse24 (+ c_~A~0.offset .cse25 4)) .cse26) (= .cse26 .cse27) (not (< .cse26 c_~min2~0)))))) (not (< .cse27 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse29 (select (select .cse32 c_~A~0.base) .cse1))) (or (not (< .cse29 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse30 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse31 (* ~M~0 4))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse30 (+ c_~A~0.offset .cse31 4)) c_~min2~0) (< (select .cse30 (+ c_~A~0.offset .cse31)) c_~min2~0)))) (= c_~min2~0 .cse29))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse35 (* ~M~0 4))) (let ((.cse33 (select .cse34 (+ c_~A~0.offset .cse35 4)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse33) (< 0 ~M~0) (not (< .cse33 c_~min2~0)) (< (select .cse34 (+ c_~A~0.offset .cse35)) c_~min2~0))))) (< (select (select .cse36 c_~A~0.base) .cse1) c_~min1~0)))))) is different from false [2023-05-20 11:51:10,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_#t~post1| 4) 4))) (and (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse0 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse5 (* ~M~0 4))) (let ((.cse2 (select .cse4 (+ c_~A~0.offset .cse5 4))) (.cse3 (select .cse4 (+ c_~A~0.offset .cse5)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse2) (< 0 ~M~0) (not (< .cse3 c_~min2~0)) (not (< .cse2 .cse3))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse7 (select (select .cse10 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse8 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse9 (* ~M~0 4))) (let ((.cse6 (select .cse8 (+ c_~A~0.offset .cse9 4)))) (or (= .cse6 .cse7) (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse6 c_~min2~0)) (< (select .cse8 (+ c_~A~0.offset .cse9)) c_~min2~0))))) (not (< .cse7 c_~min1~0)))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse13 (* ~M~0 4))) (or (< (select (select .cse11 c_~A~0.base) .cse1) c_~min1~0) (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse12 (+ c_~A~0.offset .cse13 4)) c_~min2~0) (< (select .cse12 (+ c_~A~0.offset .cse13)) c_~min2~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse15 (select (select .cse18 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse17 (* ~M~0 4))) (let ((.cse14 (select .cse16 (+ c_~A~0.offset .cse17)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (= .cse14 .cse15) (< (select .cse16 (+ c_~A~0.offset .cse17 4)) .cse14) (not (< .cse14 c_~min2~0)))))) (not (< .cse15 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse19 (select (select .cse22 c_~A~0.base) .cse1))) (or (= c_~min2~0 .cse19) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse20 (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse21 (* ~M~0 4))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse20 (+ c_~A~0.offset .cse21 4)) c_~min2~0) (< (select .cse20 (+ c_~A~0.offset .cse21)) c_~min2~0)))) (not (< .cse19 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse24 (select (select .cse28 c_~A~0.base) .cse1))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse26 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse27 (* ~M~0 4))) (let ((.cse23 (select .cse26 (+ c_~A~0.offset .cse27 4))) (.cse25 (select .cse26 (+ c_~A~0.offset .cse27)))) (or (= .cse23 .cse24) (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse25 c_~min2~0)) (not (< .cse23 .cse25)))))) (not (< .cse24 c_~min1~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse29 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse31 (* ~M~0 4))) (let ((.cse32 (select .cse30 (+ c_~A~0.offset .cse31)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse30 (+ c_~A~0.offset .cse31 4)) .cse32) (not (< .cse32 c_~min2~0)) (= c_~min1~0 .cse32)))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse35 (* ~M~0 4))) (let ((.cse33 (select .cse34 (+ c_~A~0.offset .cse35 4)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse33) (< 0 ~M~0) (not (< .cse33 c_~min2~0)) (< (select .cse34 (+ c_~A~0.offset .cse35)) c_~min2~0))))) (< (select (select .cse36 c_~A~0.base) .cse1) c_~min1~0)))))) is different from false [2023-05-20 11:51:11,286 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4) 4))) (and (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse0 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse4 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse5 (* ~M~0 4))) (let ((.cse2 (select .cse4 (+ c_~A~0.offset .cse5 4))) (.cse3 (select .cse4 (+ c_~A~0.offset .cse5)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse2) (< 0 ~M~0) (not (< .cse3 c_~min2~0)) (not (< .cse2 .cse3))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse6 (select (select .cse10 c_~A~0.base) .cse1))) (or (not (< .cse6 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse7 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse8 (* ~M~0 4))) (let ((.cse9 (select .cse7 (+ c_~A~0.offset .cse8)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse7 (+ c_~A~0.offset .cse8 4)) .cse9) (not (< .cse9 c_~min2~0)) (= .cse9 .cse6))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse11 (select (select .cse15 c_~A~0.base) .cse1))) (or (not (< .cse11 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse13 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse14 (* ~M~0 4))) (let ((.cse12 (select .cse13 (+ c_~A~0.offset .cse14 4)))) (or (<= (+ 3 ~M~0) c_~N~0) (= .cse12 .cse11) (< 0 ~M~0) (not (< .cse12 c_~min2~0)) (< (select .cse13 (+ c_~A~0.offset .cse14)) c_~min2~0))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse17 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ c_~A~0.offset .cse18 4)))) (or (<= (+ 3 ~M~0) c_~N~0) (= c_~min1~0 .cse16) (< 0 ~M~0) (not (< .cse16 c_~min2~0)) (< (select .cse17 (+ c_~A~0.offset .cse18)) c_~min2~0))))) (< (select (select .cse19 c_~A~0.base) .cse1) c_~min1~0)))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse20 (select (select .cse23 c_~A~0.base) .cse1))) (or (not (< .cse20 c_~min1~0)) (= c_~min2~0 .cse20) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse22 (* ~M~0 4))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse21 (+ c_~A~0.offset .cse22 4)) c_~min2~0) (< (select .cse21 (+ c_~A~0.offset .cse22)) c_~min2~0)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_255 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse26 (* ~M~0 4))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select (select .cse24 c_~A~0.base) .cse1) c_~min1~0) (< (select .cse25 (+ c_~A~0.offset .cse26 4)) c_~min2~0) (< (select .cse25 (+ c_~A~0.offset .cse26)) c_~min2~0)))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (let ((.cse27 (select (select .cse32 c_~A~0.base) .cse1))) (or (not (< .cse27 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse30 (select (store .cse32 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse31 (* ~M~0 4))) (let ((.cse28 (select .cse30 (+ c_~A~0.offset .cse31 4))) (.cse29 (select .cse30 (+ c_~A~0.offset .cse31)))) (or (<= (+ 3 ~M~0) c_~N~0) (= .cse28 .cse27) (< 0 ~M~0) (not (< .cse29 c_~min2~0)) (not (< .cse28 .cse29)))))))))) (forall ((v_ArrVal_254 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_254))) (or (< (select (select .cse33 c_~A~0.base) .cse1) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_255) c_~A~0.base)) (.cse35 (* ~M~0 4))) (let ((.cse36 (select .cse34 (+ c_~A~0.offset .cse35)))) (or (<= (+ 3 ~M~0) c_~N~0) (< 0 ~M~0) (< (select .cse34 (+ c_~A~0.offset .cse35 4)) .cse36) (not (< .cse36 c_~min2~0)) (= c_~min1~0 .cse36)))))))))) is different from false [2023-05-20 11:51:14,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:14,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 3610 treesize of output 4868 [2023-05-20 11:51:15,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:15,099 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 2973 treesize of output 2865 [2023-05-20 11:51:15,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:15,472 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 2865 treesize of output 2775 [2023-05-20 11:51:15,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:15,805 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 2748 treesize of output 2648 [2023-05-20 11:51:16,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:16,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 2648 treesize of output 2596 [2023-05-20 11:51:16,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:16,402 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 2596 treesize of output 2556 [2023-05-20 11:51:16,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:16,764 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 2556 treesize of output 2556 [2023-05-20 11:51:17,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:17,077 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 2529 treesize of output 2516 [2023-05-20 11:51:17,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:17,405 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 2489 treesize of output 2459 [2023-05-20 11:51:17,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:17,748 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 2432 treesize of output 2400 [2023-05-20 11:51:18,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:18,048 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 2373 treesize of output 2269 [2023-05-20 11:51:18,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:18,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2269 treesize of output 2203 [2023-05-20 11:51:18,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:18,681 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 2203 treesize of output 2162 [2023-05-20 11:51:18,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:18,996 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 2135 treesize of output 2096 [2023-05-20 11:51:19,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:19,335 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 2069 treesize of output 2007 [2023-05-20 11:51:19,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:19,658 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 2007 treesize of output 1981 [2023-05-20 11:51:19,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 11:51:19,978 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 1981 treesize of output 1988 Received shutdown request... [2023-05-20 12:04:21,863 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 12:04:21,864 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 12:04:21,864 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 12:04:21,865 WARN L249 SmtUtils]: Removed 2 from assertion stack [2023-05-20 12:04:21,868 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-20 12:04:21,891 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-20 12:04:22,082 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,SelfDestructingSolverStorable7 [2023-05-20 12:04:22,083 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. [2023-05-20 12:04:22,085 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-20 12:04:22,085 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-20 12:04:22,085 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-20 12:04:22,089 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-05-20 12:04:22,091 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 12:04:22,091 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 12:04:22,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 12:04:22 BasicIcfg [2023-05-20 12:04:22,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 12:04:22,093 INFO L158 Benchmark]: Toolchain (without parser) took 830732.94ms. Allocated memory was 217.1MB in the beginning and 968.9MB in the end (delta: 751.8MB). Free memory was 186.2MB in the beginning and 800.2MB in the end (delta: -613.9MB). Peak memory consumption was 605.8MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,093 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 217.1MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 12:04:22,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.16ms. Allocated memory was 217.1MB in the beginning and 338.7MB in the end (delta: 121.6MB). Free memory was 185.9MB in the beginning and 304.8MB in the end (delta: -118.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.20ms. Allocated memory is still 338.7MB. Free memory was 304.8MB in the beginning and 303.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,094 INFO L158 Benchmark]: Boogie Preprocessor took 28.85ms. Allocated memory is still 338.7MB. Free memory was 303.3MB in the beginning and 301.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,094 INFO L158 Benchmark]: RCFGBuilder took 586.54ms. Allocated memory is still 338.7MB. Free memory was 301.7MB in the beginning and 280.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,095 INFO L158 Benchmark]: TraceAbstraction took 829728.63ms. Allocated memory was 338.7MB in the beginning and 968.9MB in the end (delta: 630.2MB). Free memory was 279.6MB in the beginning and 800.2MB in the end (delta: -520.5MB). Peak memory consumption was 577.2MB. Max. memory is 8.0GB. [2023-05-20 12:04:22,096 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 217.1MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.16ms. Allocated memory was 217.1MB in the beginning and 338.7MB in the end (delta: 121.6MB). Free memory was 185.9MB in the beginning and 304.8MB in the end (delta: -118.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.20ms. Allocated memory is still 338.7MB. Free memory was 304.8MB in the beginning and 303.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.85ms. Allocated memory is still 338.7MB. Free memory was 303.3MB in the beginning and 301.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 586.54ms. Allocated memory is still 338.7MB. Free memory was 301.7MB in the beginning and 280.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 829728.63ms. Allocated memory was 338.7MB in the beginning and 968.9MB in the end (delta: 630.2MB). Free memory was 279.6MB in the beginning and 800.2MB in the end (delta: -520.5MB). Peak memory consumption was 577.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3441, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 465, dependent conditional: 445, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1856, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1834, independent conditional: 0, independent unconditional: 1834, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2996, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1856, unknown conditional: 0, unknown unconditional: 1856] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1836, Positive conditional cache size: 0, Positive unconditional cache size: 1836, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: 445 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 221, Number of trivial persistent sets: 180, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2124, independent: 2104, independent conditional: 0, independent unconditional: 2104, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3441, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 465, dependent conditional: 445, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 872, independent unconditional: 2104, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2996, independent: 2976, independent conditional: 0, independent unconditional: 2976, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1856, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1834, independent conditional: 0, independent unconditional: 1834, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 169, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2996, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1856, unknown conditional: 0, unknown unconditional: 1856] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1836, Positive conditional cache size: 0, Positive unconditional cache size: 1836, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: 445 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 16ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 829.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 6.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1703 NumberOfCodeBlocks, 1703 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2468 ConstructedInterpolants, 71 QuantifiedInterpolants, 21272 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1780 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 304/372 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown