/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 08:47:07,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 08:47:07,810 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 08:47:07,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 08:47:07,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 08:47:07,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 08:47:07,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 08:47:07,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 08:47:07,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 08:47:07,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 08:47:07,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 08:47:07,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 08:47:07,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 08:47:07,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 08:47:07,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 08:47:07,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 08:47:07,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 08:47:07,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 08:47:07,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 08:47:07,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 08:47:07,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 08:47:07,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 08:47:07,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 08:47:07,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 08:47:07,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 08:47:07,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 08:47:07,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 08:47:07,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 08:47:07,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 08:47:07,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 08:47:07,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 08:47:07,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 08:47:07,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 08:47:07,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 08:47:07,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 08:47:07,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 08:47:07,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 08:47:07,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 08:47:07,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 08:47:07,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 08:47:07,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 08:47:07,881 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 08:47:07,914 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 08:47:07,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 08:47:07,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 08:47:07,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 08:47:07,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 08:47:07,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 08:47:07,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 08:47:07,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 08:47:07,916 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 08:47:07,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 08:47:07,917 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 08:47:07,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 08:47:07,918 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 08:47:07,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 08:47:07,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 08:47:07,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 08:47:07,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 08:47:07,919 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 08:47:07,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-20 08:47:08,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 08:47:08,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 08:47:08,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 08:47:08,142 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 08:47:08,147 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 08:47:08,149 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-05-20 08:47:08,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b25a8038/027c74d409e34307b1e117e9d5a74d22/FLAG014c676de [2023-05-20 08:47:08,584 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 08:47:08,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-05-20 08:47:08,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b25a8038/027c74d409e34307b1e117e9d5a74d22/FLAG014c676de [2023-05-20 08:47:08,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b25a8038/027c74d409e34307b1e117e9d5a74d22 [2023-05-20 08:47:08,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 08:47:08,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 08:47:08,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 08:47:08,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 08:47:08,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 08:47:08,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7c57cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08, skipping insertion in model container [2023-05-20 08:47:08,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 08:47:08,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 08:47:08,756 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-hom.wvr.c[2586,2599] [2023-05-20 08:47:08,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 08:47:08,766 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 08:47:08,780 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-hom.wvr.c[2586,2599] [2023-05-20 08:47:08,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 08:47:08,792 INFO L208 MainTranslator]: Completed translation [2023-05-20 08:47:08,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08 WrapperNode [2023-05-20 08:47:08,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 08:47:08,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 08:47:08,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 08:47:08,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 08:47:08,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,831 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2023-05-20 08:47:08,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 08:47:08,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 08:47:08,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 08:47:08,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 08:47:08,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,853 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 08:47:08,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 08:47:08,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 08:47:08,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 08:47:08,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (1/1) ... [2023-05-20 08:47:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 08:47:08,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:08,881 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 08:47:08,883 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 08:47:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 08:47:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 08:47:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 08:47:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 08:47:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 08:47:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 08:47:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 08:47:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 08:47:08,909 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 08:47:08,980 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 08:47:08,982 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 08:47:09,217 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 08:47:09,257 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 08:47:09,257 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-05-20 08:47:09,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 08:47:09 BoogieIcfgContainer [2023-05-20 08:47:09,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 08:47:09,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 08:47:09,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 08:47:09,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 08:47:09,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 08:47:08" (1/3) ... [2023-05-20 08:47:09,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b71d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 08:47:09, skipping insertion in model container [2023-05-20 08:47:09,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:47:08" (2/3) ... [2023-05-20 08:47:09,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b71d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 08:47:09, skipping insertion in model container [2023-05-20 08:47:09,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 08:47:09" (3/3) ... [2023-05-20 08:47:09,266 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-05-20 08:47:09,271 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 08:47:09,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 08:47:09,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 08:47:09,278 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 08:47:09,327 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 08:47:09,383 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 08:47:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 08:47:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:09,384 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 08:47:09,392 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 08:47:09,422 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 08:47:09,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 08:47:09,444 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;@1846208a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 08:47:09,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-20 08:47:09,670 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 08:47:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 73393093, now seen corresponding path program 1 times [2023-05-20 08:47:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127542929] [2023-05-20 08:47:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127542929] [2023-05-20 08:47:09,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127542929] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 08:47:09,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 08:47:09,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 08:47:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407710470] [2023-05-20 08:47:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:47:09,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 08:47:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:47:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 08:47:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 08:47:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:09,967 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:47:09,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 08:47:09,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 08:47:10,014 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 08:47:10,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -818270683, now seen corresponding path program 1 times [2023-05-20 08:47:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:10,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628676801] [2023-05-20 08:47:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 08:47:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:10,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628676801] [2023-05-20 08:47:10,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628676801] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 08:47:10,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 08:47:10,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 08:47:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79745955] [2023-05-20 08:47:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:47:10,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:47:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:47:10,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:47:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-20 08:47:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:47:10,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 08:47:10,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:10,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 08:47:10,521 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 08:47:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash -321924576, now seen corresponding path program 1 times [2023-05-20 08:47:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:10,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187280480] [2023-05-20 08:47:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:10,827 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 08:47:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187280480] [2023-05-20 08:47:10,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187280480] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:10,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518033497] [2023-05-20 08:47:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:10,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:10,833 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 08:47:10,856 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 08:47:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:10,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 08:47:10,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:47:11,197 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 08:47:11,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:47:11,371 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 08:47:11,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518033497] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:11,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 08:47:11,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-05-20 08:47:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958947545] [2023-05-20 08:47:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:47:11,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-05-20 08:47:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:47:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-05-20 08:47:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-05-20 08:47:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:11,373 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:47:11,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 08:47:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:11,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:47:11,559 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 08:47:11,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 08:47:11,757 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 08:47:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 647303229, now seen corresponding path program 1 times [2023-05-20 08:47:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:11,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33204130] [2023-05-20 08:47:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:11,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33204130] [2023-05-20 08:47:11,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33204130] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:11,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160122809] [2023-05-20 08:47:11,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:11,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:11,914 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 08:47:11,917 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 08:47:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:11,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 08:47:12,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:47:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:12,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:47:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:12,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160122809] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:12,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 08:47:12,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 08:47:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145836298] [2023-05-20 08:47:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:47:12,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:47:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:47:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:47:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 08:47:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:12,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:47:12,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.571428571428573) internal successors, (123), 7 states have internal predecessors, (123), 0 states have call successors, (0), 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 08:47:12,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:12,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:12,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:47:12,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:47:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:12,379 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 08:47:12,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:12,569 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 08:47:12,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1645667997, now seen corresponding path program 1 times [2023-05-20 08:47:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:12,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171223863] [2023-05-20 08:47:12,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171223863] [2023-05-20 08:47:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171223863] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694134606] [2023-05-20 08:47:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:12,743 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 08:47:12,768 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 08:47:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:12,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 08:47:12,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:47:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:13,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:47:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:47:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694134606] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:47:13,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:47:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-20 08:47:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218918631] [2023-05-20 08:47:13,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:47:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-20 08:47:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:47:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-20 08:47:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-20 08:47:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:13,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:47:13,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.0) internal successors, (240), 24 states have internal predecessors, (240), 0 states have call successors, (0), 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 08:47:13,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:13,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:13,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:47:13,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:13,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:47:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:47:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:47:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:47:13,414 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 08:47:13,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:13,605 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 08:47:13,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:47:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1159826520, now seen corresponding path program 2 times [2023-05-20 08:47:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:47:13,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620111850] [2023-05-20 08:47:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:47:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:47:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:47:16,578 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 08:47:16,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:47:16,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620111850] [2023-05-20 08:47:16,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620111850] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:47:16,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74966898] [2023-05-20 08:47:16,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 08:47:16,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:47:16,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:47:16,580 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 08:47:16,628 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 08:47:16,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 08:47:16,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:47:16,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 66 conjunts are in the unsatisfiable core [2023-05-20 08:47:16,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:47:17,433 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 13 treesize of output 9 [2023-05-20 08:47:17,771 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 08:47:17,945 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 08:47:18,205 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 08:47:20,550 INFO L356 Elim1Store]: treesize reduction 80, result has 83.1 percent of original size [2023-05-20 08:47:20,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 221 treesize of output 497 [2023-05-20 08:47:35,636 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:37,180 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:40,543 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:41,887 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:41,889 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-05-20 08:47:41,896 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:41,906 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:42,226 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:42,491 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:43,819 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:46,209 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:46,211 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-05-20 08:47:46,225 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:46,238 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:46,791 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:47,081 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-05-20 08:47:57,725 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 08:47:57,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:49:13,898 WARN L233 SmtUtils]: Spent 59.27s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 08:49:30,357 WARN L233 SmtUtils]: Spent 13.04s on a formula simplification that was a NOOP. DAG size: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 08:49:45,879 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse25 (<= c_~min2~0 c_~min3~0)) (.cse32 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse3 (+ c_~A~0.offset 4))) (and (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse2 (* ~M~0 4))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset .cse2 4)))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0)) (< 0 ~M~0) (not (< (select .cse1 c_~A~0.offset) c_~min1~0)) (< ~M~0 0) (< (select .cse1 (+ c_~A~0.offset .cse2)) c_~min3~0) (= c_~min2~0 (select .cse1 .cse3)))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse5 (select .cse4 .cse3))) (or (< (select .cse4 (+ c_~A~0.offset (* ~M~0 4) 4)) c_~min3~0) (not (< .cse5 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse5) (< (select .cse4 c_~A~0.offset) c_~min1~0))))) .cse6) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse3)) (.cse9 (* ~M~0 4))) (or (not (< .cse7 c_~min1~0)) (< (select .cse8 (+ c_~A~0.offset .cse9 4)) c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse7) (not (< (select .cse8 (+ c_~A~0.offset .cse9)) c_~min3~0)) (< (select .cse8 c_~A~0.offset) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse11 (* ~M~0 4))) (let ((.cse12 (select .cse10 (+ c_~A~0.offset .cse11)))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse10 (+ c_~A~0.offset .cse11 4)) .cse12) (= c_~min1~0 .cse12) (not (< .cse12 c_~min3~0)) (<= c_~min2~0 .cse12) (< (select .cse10 c_~A~0.offset) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse15 (select .cse13 c_~A~0.offset)) (.cse16 (select .cse13 .cse3)) (.cse14 (* ~M~0 4))) (or (< (select .cse13 (+ c_~A~0.offset .cse14 4)) c_~min2~0) (< 0 ~M~0) (not (< .cse15 c_~min1~0)) (not (< .cse16 .cse15)) (< ~M~0 0) (= c_~min2~0 .cse16) (not (< (select .cse13 (+ c_~A~0.offset .cse14)) c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse20 (* ~M~0 4))) (let ((.cse17 (select .cse19 (+ c_~A~0.offset .cse20 4))) (.cse18 (select .cse19 (+ c_~A~0.offset .cse20)))) (or (not (< .cse17 .cse18)) (= c_~min1~0 .cse17) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse17) (not (< .cse18 c_~min3~0)) (< (select .cse19 .cse3) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse23 (* ~M~0 4)) (.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse21 (select .cse22 c_~A~0.offset)) (.cse24 (select .cse22 (+ c_~A~0.offset .cse23)))) (or (< 0 ~M~0) (not (< .cse21 c_~min1~0)) (< ~M~0 0) (= c_~min2~0 .cse21) (< (select .cse22 (+ c_~A~0.offset .cse23 4)) .cse24) (not (< .cse24 c_~min3~0)) (< .cse24 c_~min2~0))))) (or .cse25 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse26 (select .cse27 c_~A~0.offset))) (or (= c_~min3~0 .cse26) (< 0 ~M~0) (not (< .cse26 c_~min1~0)) (< (select .cse27 .cse3) .cse26) (< ~M~0 0) (< (select .cse27 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))))) (or .cse25 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse28 (select .cse29 .cse3))) (or (= .cse28 c_~min3~0) (< (select .cse29 (+ c_~A~0.offset (* ~M~0 4) 4)) c_~min3~0) (not (< .cse28 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse29 c_~A~0.offset) c_~min1~0)))))) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (< 0 ~M~0) (not (< .cse30 c_~min1~0)) (< (select .cse31 .cse3) .cse30) (< ~M~0 0) (= c_~min2~0 .cse30) (< (select .cse31 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))))) (or .cse32 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse34 (* ~M~0 4))) (let ((.cse35 (select .cse33 (+ c_~A~0.offset .cse34)))) (or (< 0 ~M~0) (< ~M~0 0) (< (select .cse33 (+ c_~A~0.offset .cse34 4)) .cse35) (not (< .cse35 c_~min3~0)) (< .cse35 c_~min2~0) (< (select .cse33 c_~A~0.offset) c_~min1~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse39 (* ~M~0 4))) (let ((.cse37 (select .cse38 (+ c_~A~0.offset .cse39 4))) (.cse36 (select .cse38 .cse3))) (or (not (< .cse36 c_~min1~0)) (< .cse37 c_~min2~0) (not (< .cse37 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse38 (+ c_~A~0.offset .cse39)) c_~min3~0) (= c_~min2~0 .cse36) (< (select .cse38 c_~A~0.offset) c_~min1~0))))) (or .cse25 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse41 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse40 (select .cse41 .cse3)) (.cse42 (select .cse41 c_~A~0.offset))) (or (= .cse40 c_~min3~0) (< (select .cse41 (+ c_~A~0.offset (* ~M~0 4) 4)) c_~min3~0) (< 0 ~M~0) (not (< .cse42 c_~min1~0)) (not (< .cse40 .cse42)) (< ~M~0 0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse45 (* ~M~0 4))) (let ((.cse43 (select .cse44 (+ c_~A~0.offset .cse45 4)))) (or (= c_~min1~0 .cse43) (not (< .cse43 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse44 (+ c_~A~0.offset .cse45)) c_~min3~0) (<= c_~min2~0 .cse43) (< (select .cse44 .cse3) c_~min1~0))))) (or (and (or .cse25 (= c_~min1~0 c_~min3~0)) (or .cse32 .cse6)) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse47 (* ~M~0 4)) (.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (or (< (select .cse46 (+ c_~A~0.offset .cse47 4)) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse46 (+ c_~A~0.offset .cse47)) c_~min3~0) (< (select .cse46 c_~A~0.offset) c_~min1~0) (< (select .cse46 .cse3) c_~min1~0))))) (or .cse32 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse51 (* ~M~0 4))) (let ((.cse48 (select .cse50 (+ c_~A~0.offset .cse51 4))) (.cse49 (select .cse50 (+ c_~A~0.offset .cse51)))) (or (not (< .cse48 .cse49)) (< .cse48 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse49 c_~min3~0)) (< (select .cse50 .cse3) c_~min1~0)))))) (or .cse32 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base)) (.cse54 (* ~M~0 4))) (let ((.cse52 (select .cse53 (+ c_~A~0.offset .cse54 4)))) (or (< .cse52 c_~min2~0) (not (< .cse52 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse53 (+ c_~A~0.offset .cse54)) c_~min3~0) (< (select .cse53 .cse3) c_~min1~0)))))) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) c_~A~0.base))) (let ((.cse56 (select .cse55 c_~A~0.offset)) (.cse57 (select .cse55 .cse3))) (or (< (select .cse55 (+ c_~A~0.offset (* ~M~0 4) 4)) c_~min3~0) (< 0 ~M~0) (not (< .cse56 c_~min1~0)) (not (< .cse57 .cse56)) (< ~M~0 0) (= c_~min2~0 .cse57)))))))) is different from false [2023-05-20 08:49:50,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (<= c_~min2~0 c_~min3~0)) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse39 (< c_~min3~0 c_~min2~0)) (.cse4 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse5 (* ~M~0 4))) (let ((.cse1 (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse5 4))) (.cse2 (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse5)))) (or (< .cse1 c_~min2~0) (not (< .cse1 .cse2)) (< (select .cse3 .cse4) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse2 c_~min3~0))))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse8 (* ~M~0 4))) (let ((.cse7 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8 4)))) (or (< (select .cse6 .cse4) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse7) (<= c_~min2~0 .cse7) (not (< .cse7 c_~min3~0)) (< (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8)) c_~min3~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse11 (* ~M~0 4)) (.cse9 (select .cse10 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse12 (select .cse10 .cse4))) (or (not (< .cse9 c_~min1~0)) (< (select .cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse11 4)) c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< (select .cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse11)) c_~min3~0)) (not (< .cse12 .cse9)) (= c_~min2~0 .cse12))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse16 (* ~M~0 4))) (let ((.cse14 (select .cse15 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16))) (.cse13 (select .cse15 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse13 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse14 c_~min3~0)) (< (select .cse15 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse16 4)) .cse14) (< .cse14 c_~min2~0) (= c_~min2~0 .cse13))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse19 (* ~M~0 4))) (let ((.cse18 (select .cse17 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse19 4)))) (or (not (< (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)) (< .cse18 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse18 c_~min3~0)) (= c_~min2~0 (select .cse17 .cse4)) (< (select .cse17 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse19)) c_~min3~0))))) (or .cse20 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse21 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= .cse21 c_~min3~0) (< (select .cse22 .cse4) .cse21) (< (select .cse22 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse25 (* ~M~0 4))) (let ((.cse23 (select .cse24 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse25)))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse23 c_~min3~0)) (< (select .cse24 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse25 4)) .cse23) (< .cse23 c_~min2~0) (< (select .cse24 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) .cse0) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse28 (* ~M~0 4))) (let ((.cse26 (select .cse27 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28 4)))) (or (< .cse26 c_~min2~0) (< (select .cse27 .cse4) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse26 c_~min3~0)) (< (select .cse27 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse28)) c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse31 (* ~M~0 4))) (let ((.cse29 (select .cse30 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse31)))) (or (< 0 ~M~0) (<= c_~min2~0 .cse29) (< ~M~0 0) (not (< .cse29 c_~min3~0)) (< (select .cse30 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse31 4)) .cse29) (= c_~min1~0 .cse29) (< (select .cse30 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse33 (* ~M~0 4)) (.cse34 (select .cse32 .cse4))) (or (< (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33 4)) c_~min2~0) (< 0 ~M~0) (not (< .cse34 c_~min1~0)) (< ~M~0 0) (not (< (select .cse32 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse33)) c_~min3~0)) (< (select .cse32 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (= c_~min2~0 .cse34))))) (or .cse20 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse36 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse35 (select .cse36 .cse4))) (or (< 0 ~M~0) (not (< .cse35 c_~min1~0)) (< ~M~0 0) (= c_~min3~0 .cse35) (< (select .cse36 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse36 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4) 4)) c_~min3~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse37 (select .cse38 .cse4))) (or (< 0 ~M~0) (not (< .cse37 c_~min1~0)) (< ~M~0 0) (< (select .cse38 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse38 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4) 4)) c_~min3~0) (= c_~min2~0 .cse37))))) .cse39) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse43 (* ~M~0 4))) (let ((.cse40 (select .cse42 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse43 4))) (.cse41 (select .cse42 .cse4))) (or (< .cse40 c_~min2~0) (< 0 ~M~0) (not (< .cse41 c_~min1~0)) (< ~M~0 0) (< (select .cse42 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (not (< .cse40 c_~min3~0)) (= c_~min2~0 .cse41) (< (select .cse42 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse43)) c_~min3~0))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse44 (select .cse46 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse45 (select .cse46 .cse4))) (or (not (< .cse44 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse45 .cse44)) (< (select .cse46 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4) 4)) c_~min3~0) (= c_~min2~0 .cse45))))) .cse39) (or .cse20 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse49 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse48 (select .cse49 .cse4))) (or (not (< .cse47 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse48 .cse47)) (= c_~min3~0 .cse48) (< (select .cse49 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4) 4)) c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse53 (* ~M~0 4))) (let ((.cse51 (select .cse52 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse53))) (.cse50 (select .cse52 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse53 4)))) (or (not (< .cse50 .cse51)) (< (select .cse52 .cse4) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse50) (not (< .cse51 c_~min3~0)) (<= c_~min2~0 .cse50))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse54 (select .cse55 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse54 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min2~0 .cse54) (< (select .cse55 .cse4) .cse54) (< (select .cse55 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0))))) .cse39) (or (and (or .cse20 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse39)) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse57 (* ~M~0 4))) (or (< (select .cse56 .cse4) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select .cse56 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select .cse56 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse57 4)) c_~min3~0) (< (select .cse56 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse57)) c_~min3~0))))))) is different from false [2023-05-20 08:49:53,020 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse5 (<= c_~min2~0 c_~min3~0)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (* ~M~0 4))) (let ((.cse1 (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0) (< 0 ~M~0) (< (select .cse2 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (< (select .cse2 .cse4) c_~min1~0)))))) (or (and (or .cse5 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse6)) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse8 (* ~M~0 4)) (.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (< (select .cse7 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (< (select .cse7 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< (select .cse7 .cse4) c_~min1~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse12 (* ~M~0 4))) (let ((.cse9 (select .cse11 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse10 (select .cse11 (+ .cse12 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse9 c_~min3~0)) (< 0 ~M~0) (= c_~min1~0 .cse10) (< ~M~0 0) (not (< .cse10 .cse9)) (< (select .cse11 .cse4) c_~min1~0) (<= c_~min2~0 .cse10))))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse15 (* ~M~0 4))) (let ((.cse14 (select .cse13 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse14 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select .cse13 (+ .cse15 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse14) (< .cse14 c_~min2~0)))))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse19 (* ~M~0 4))) (let ((.cse16 (select .cse18 (+ .cse19 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse17 (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse16 c_~min2~0) (not (< .cse17 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse16 .cse17)) (< (select .cse18 .cse4) c_~min1~0)))))) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< (select .cse20 .cse4) .cse21) (< (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< .cse21 c_~min1~0)) (= c_~min2~0 .cse21)))))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse24 .cse4)) (.cse23 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse22 .cse23)) (< 0 ~M~0) (< ~M~0 0) (= .cse22 c_~min3~0) (not (< .cse23 c_~min1~0)) (< (select .cse24 (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse27 (* ~M~0 4))) (let ((.cse26 (select .cse25 (+ .cse27 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= c_~min2~0 (select .cse25 .cse4)) (not (< .cse26 c_~min3~0)) (< .cse26 c_~min2~0) (< 0 ~M~0) (< (select .cse25 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse28 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (* ~M~0 4))) (let ((.cse29 (select .cse28 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (not (< .cse29 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse29) (<= c_~min2~0 .cse29) (< (select .cse28 (+ .cse30 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse29))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse33 .cse4)) (.cse34 (* ~M~0 4)) (.cse32 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse31 .cse32)) (= c_~min2~0 .cse31) (< (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (not (< (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse32 c_~min1~0)))))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse35 .cse4))) (or (< (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (not (< .cse36 c_~min1~0)) (< ~M~0 0) (= .cse36 c_~min3~0) (< (select .cse35 (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse40 (* ~M~0 4)) (.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse37 (select .cse39 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse37 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (not (< .cse38 c_~min1~0)) (= c_~min2~0 .cse38) (< (select .cse39 (+ .cse40 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse37) (< .cse37 c_~min2~0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse43 (* ~M~0 4))) (let ((.cse41 (select .cse42 (+ .cse43 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse41 c_~min3~0)) (< 0 ~M~0) (< (select .cse42 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (= c_~min1~0 .cse41) (< ~M~0 0) (< (select .cse42 .cse4) c_~min1~0) (<= c_~min2~0 .cse41))))) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse44 (select .cse45 .cse4))) (or (= c_~min2~0 .cse44) (< (select .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (not (< .cse44 c_~min1~0)) (< ~M~0 0) (< (select .cse45 (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse6) (or (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (select .cse48 .cse4)) (.cse47 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse46 .cse47)) (= c_~min2~0 .cse46) (< 0 ~M~0) (< ~M~0 0) (not (< .cse47 c_~min1~0)) (< (select .cse48 (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0))))) .cse6) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse52 (* ~M~0 4))) (let ((.cse50 (select .cse51 (+ .cse52 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse49 (select .cse51 .cse4))) (or (= c_~min2~0 .cse49) (not (< .cse50 c_~min3~0)) (< (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< .cse50 c_~min2~0) (< 0 ~M~0) (not (< .cse49 c_~min1~0)) (< (select .cse51 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0))))) (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse55 (* ~M~0 4)) (.cse53 (select .cse54 .cse4))) (or (= c_~min2~0 .cse53) (< (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (select .cse54 (+ .cse55 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (not (< (select .cse54 (+ .cse55 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0)) (< 0 ~M~0) (not (< .cse53 c_~min1~0)) (< ~M~0 0))))) (or .cse5 (forall ((~M~0 Int) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int)) (v_ArrVal_165 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_164) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (< (select .cse56 .cse4) .cse57) (< (select .cse56 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (< ~M~0 0) (not (< .cse57 c_~min1~0)) (= .cse57 c_~min3~0)))))))) is different from false [2023-05-20 08:49:55,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:49:55,265 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 160 treesize of output 112 [2023-05-20 08:49:55,297 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:49:55,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2687 treesize of output 2531 [2023-05-20 08:49:55,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:49:55,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:49:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1969 treesize of output 1849 [2023-05-20 08:49:55,359 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:49:55,360 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 2407 treesize of output 1931 [2023-05-20 08:49:55,394 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:49:55,394 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 1927 treesize of output 1691 [2023-05-20 08:49:56,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:49:56,379 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 182 treesize of output 122 [2023-05-20 08:49:56,417 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:49:56,418 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 2973 treesize of output 2833 [2023-05-20 08:49:56,480 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:49:56,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2825 treesize of output 2433 [2023-05-20 08:49:56,556 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:49:56,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2425 treesize of output 2233 [2023-05-20 08:49:56,616 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:49:56,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2225 treesize of output 2133 [2023-05-20 08:49:59,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:49:59,188 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 188 treesize of output 128 [2023-05-20 08:49:59,210 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:49:59,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3163 treesize of output 2987 [2023-05-20 08:49:59,259 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:49:59,259 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 2983 treesize of output 2723 [2023-05-20 08:49:59,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:49:59,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1641 treesize of output 1509 [2023-05-20 08:49:59,333 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:49:59,334 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 2587 treesize of output 2063 [2023-05-20 08:50:00,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:00,675 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 156 treesize of output 108 [2023-05-20 08:50:00,702 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:00,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2558 treesize of output 2414 [2023-05-20 08:50:00,745 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:00,746 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 2410 treesize of output 1982 [2023-05-20 08:50:00,801 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:00,802 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 1978 treesize of output 1766 [2023-05-20 08:50:00,853 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:00,854 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 1156 treesize of output 1052 [2023-05-20 08:50:02,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:02,384 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 159 treesize of output 111 [2023-05-20 08:50:02,412 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:02,413 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 702 treesize of output 674 [2023-05-20 08:50:02,442 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:02,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 666 treesize of output 570 [2023-05-20 08:50:02,476 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:02,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 518 [2023-05-20 08:50:02,511 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:02,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 351 [2023-05-20 08:50:03,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:03,732 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 149 treesize of output 101 [2023-05-20 08:50:03,757 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:03,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1147 treesize of output 1093 [2023-05-20 08:50:03,788 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:03,789 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 1089 treesize of output 941 [2023-05-20 08:50:03,821 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:03,822 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 937 treesize of output 903 [2023-05-20 08:50:03,859 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:03,860 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 899 treesize of output 827 [2023-05-20 08:50:06,409 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:06,410 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 193 treesize of output 1 [2023-05-20 08:50:06,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:06,424 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 189 treesize of output 129 [2023-05-20 08:50:06,458 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:06,458 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 829 treesize of output 795 [2023-05-20 08:50:06,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:50:06,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:50:06,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:50:06,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 512 [2023-05-20 08:50:06,517 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:06,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 757 treesize of output 645 [2023-05-20 08:50:06,571 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:06,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 637 treesize of output 585 [2023-05-20 08:50:07,949 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:07,949 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 163 treesize of output 1 [2023-05-20 08:50:07,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:07,978 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 145 treesize of output 97 [2023-05-20 08:50:08,012 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:50:08,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1082 treesize of output 1034 [2023-05-20 08:50:08,047 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:50:08,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1030 treesize of output 970 [2023-05-20 08:50:08,084 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:50:08,085 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 966 treesize of output 842 [2023-05-20 08:50:08,123 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-05-20 08:50:08,123 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 541 treesize of output 513 [2023-05-20 08:50:09,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:09,105 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 123 treesize of output 87 [2023-05-20 08:50:09,127 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:09,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1094 treesize of output 1048 [2023-05-20 08:50:09,158 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:09,158 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 1044 treesize of output 912 [2023-05-20 08:50:09,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:50:09,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 575 treesize of output 541 [2023-05-20 08:50:09,221 INFO L356 Elim1Store]: treesize reduction 19, result has 17.4 percent of original size [2023-05-20 08:50:09,221 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 874 treesize of output 810 [2023-05-20 08:50:10,048 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:10,049 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 156 treesize of output 1 [2023-05-20 08:50:10,068 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:10,068 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 145 treesize of output 1 [2023-05-20 08:50:10,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:50:10,102 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 124 treesize of output 88 [2023-05-20 08:50:10,140 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:10,141 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 2261 treesize of output 2161 [2023-05-20 08:50:10,204 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:10,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2153 treesize of output 2009 [2023-05-20 08:50:10,247 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:50:10,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:50:10,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:50:10,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1003 treesize of output 927 [2023-05-20 08:50:10,291 INFO L356 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2023-05-20 08:50:10,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1925 treesize of output 1629 [2023-05-20 08:50:14,800 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:14,800 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 149 treesize of output 1 [2023-05-20 08:50:14,811 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:14,812 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 185 treesize of output 1 [2023-05-20 08:50:14,825 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:14,825 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 130 treesize of output 1 [2023-05-20 08:50:14,842 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-05-20 08:50:14,842 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 123 treesize of output 1 [2023-05-20 08:50:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2023-05-20 08:50:15,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74966898] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:50:15,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:50:15,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 29] total 92 [2023-05-20 08:50:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589436048] [2023-05-20 08:50:15,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:50:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2023-05-20 08:50:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:50:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2023-05-20 08:50:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=7087, Unknown=32, NotChecked=528, Total=8372 [2023-05-20 08:50:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:50:15,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:50:15,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 4.141304347826087) internal successors, (381), 92 states have internal predecessors, (381), 0 states have call successors, (0), 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 08:50:15,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:50:15,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:50:15,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:50:15,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:50:15,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:50:15,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:00,946 WARN L233 SmtUtils]: Spent 10.90s on a formula simplification. DAG size of input: 223 DAG size of output: 199 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 08:51:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-20 08:51:01,749 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 08:51:01,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:01,934 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 08:51:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -217068287, now seen corresponding path program 3 times [2023-05-20 08:51:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:01,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094520467] [2023-05-20 08:51:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:02,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:02,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094520467] [2023-05-20 08:51:02,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094520467] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:02,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581311164] [2023-05-20 08:51:02,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 08:51:02,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:02,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:02,206 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 08:51:02,209 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 08:51:02,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 08:51:02,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:51:02,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2023-05-20 08:51:02,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:02,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:51:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:03,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581311164] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:51:03,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:51:03,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2023-05-20 08:51:03,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112248663] [2023-05-20 08:51:03,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:51:03,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-20 08:51:03,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:51:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-20 08:51:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2023-05-20 08:51:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:03,081 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:51:03,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.970588235294118) internal successors, (271), 34 states have internal predecessors, (271), 0 states have call successors, (0), 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 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-05-20 08:51:03,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-20 08:51:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:03,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 08:51:03,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:03,631 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 08:51:03,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:03,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1140896316, now seen corresponding path program 4 times [2023-05-20 08:51:03,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:03,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558144082] [2023-05-20 08:51:03,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:03,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 08:51:03,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:03,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558144082] [2023-05-20 08:51:03,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558144082] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:03,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306102555] [2023-05-20 08:51:03,927 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 08:51:03,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:03,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:03,930 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 08:51:03,934 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 08:51:04,025 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 08:51:04,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:51:04,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 08:51:04,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 08:51:04,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:51:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-20 08:51:04,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306102555] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:51:04,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:51:04,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2023-05-20 08:51:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474908160] [2023-05-20 08:51:04,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:51:04,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-20 08:51:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:51:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-20 08:51:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2023-05-20 08:51:04,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:04,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:51:04,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.216216216216216) internal successors, (230), 37 states have internal predecessors, (230), 0 states have call successors, (0), 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 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:04,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:05,909 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 08:51:06,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:06,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 08:51:06,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:06,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1858592320, now seen corresponding path program 5 times [2023-05-20 08:51:06,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:06,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101231420] [2023-05-20 08:51:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:06,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-20 08:51:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101231420] [2023-05-20 08:51:06,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101231420] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356914435] [2023-05-20 08:51:06,348 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-20 08:51:06,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:06,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:06,349 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 08:51:06,369 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 08:51:06,442 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-05-20 08:51:06,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:51:06,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjunts are in the unsatisfiable core [2023-05-20 08:51:06,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 08:51:06,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:51:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 42 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 08:51:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356914435] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:51:07,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:51:07,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2023-05-20 08:51:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373285158] [2023-05-20 08:51:07,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:51:07,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-20 08:51:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:51:07,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-20 08:51:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2023-05-20 08:51:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:07,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:51:07,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.689655172413794) internal successors, (281), 29 states have internal predecessors, (281), 0 states have call successors, (0), 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 08:51:07,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:07,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:07,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:07,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:51:07,679 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 08:51:07,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-05-20 08:51:07,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 08:51:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1515080928, now seen corresponding path program 6 times [2023-05-20 08:51:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:07,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305054656] [2023-05-20 08:51:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305054656] [2023-05-20 08:51:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305054656] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502993084] [2023-05-20 08:51:08,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-05-20 08:51:08,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:08,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:08,373 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 08:51:08,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-20 08:51:08,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-05-20 08:51:08,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:51:08,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 23 conjunts are in the unsatisfiable core [2023-05-20 08:51:08,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:09,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:51:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 08:51:10,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502993084] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:51:10,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:51:10,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 50 [2023-05-20 08:51:10,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309209392] [2023-05-20 08:51:10,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:51:10,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-05-20 08:51:10,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:51:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-05-20 08:51:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2095, Unknown=0, NotChecked=0, Total=2450 [2023-05-20 08:51:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:10,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:51:10,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.74) internal successors, (287), 50 states have internal predecessors, (287), 0 states have call successors, (0), 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 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:51:10,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:51:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 08:51:10,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-20 08:51:10,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-20 08:51:10,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 08:51:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash -733797115, now seen corresponding path program 7 times [2023-05-20 08:51:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:10,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914852221] [2023-05-20 08:51:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:10,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 11 proven. 81 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 08:51:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914852221] [2023-05-20 08:51:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914852221] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623135932] [2023-05-20 08:51:11,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-05-20 08:51:11,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:11,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:11,160 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 08:51:11,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-20 08:51:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:11,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-20 08:51:11,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 24 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 08:51:11,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:51:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 46 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 08:51:12,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623135932] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:51:12,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:51:12,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 44 [2023-05-20 08:51:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650396433] [2023-05-20 08:51:12,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:51:12,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-05-20 08:51:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:51:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-05-20 08:51:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-05-20 08:51:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:12,295 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:51:12,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 7.136363636363637) internal successors, (314), 44 states have internal predecessors, (314), 0 states have call successors, (0), 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 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-05-20 08:51:12,295 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:51:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-05-20 08:51:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 08:51:13,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-20 08:51:13,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-20 08:51:13,217 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 08:51:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:51:13,217 INFO L85 PathProgramCache]: Analyzing trace with hash 946051188, now seen corresponding path program 8 times [2023-05-20 08:51:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:51:13,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241238019] [2023-05-20 08:51:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:51:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:51:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:51:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 08:51:29,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:51:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241238019] [2023-05-20 08:51:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241238019] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:51:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113041948] [2023-05-20 08:51:29,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 08:51:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:51:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:51:29,131 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 08:51:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-20 08:51:29,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 08:51:29,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:51:29,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 97 conjunts are in the unsatisfiable core [2023-05-20 08:51:29,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:51:30,996 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 15 treesize of output 11 [2023-05-20 08:51:31,960 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 08:51:32,262 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 08:51:32,677 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 Received shutdown request... [2023-05-20 09:01:00,798 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 09:01:00,798 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 09:01:00,798 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 09:01:00,975 WARN L249 SmtUtils]: Removed 807 from assertion stack [2023-05-20 09:01:00,979 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-20 09:01:00,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-20 09:01:01,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-20 09:01:01,182 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 175 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6522 for 542653ms.. [2023-05-20 09:01:01,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-20 09:01:01,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-20 09:01:01,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-20 09:01:01,186 INFO L444 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1] [2023-05-20 09:01:01,188 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 09:01:01,188 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 09:01:01,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 09:01:01 BasicIcfg [2023-05-20 09:01:01,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 09:01:01,190 INFO L158 Benchmark]: Toolchain (without parser) took 832588.35ms. Allocated memory was 213.9MB in the beginning and 980.4MB in the end (delta: 766.5MB). Free memory was 185.1MB in the beginning and 619.3MB in the end (delta: -434.1MB). Peak memory consumption was 621.5MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 213.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.85ms. Allocated memory is still 213.9MB. Free memory was 184.9MB in the beginning and 184.0MB in the end (delta: 885.1kB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.76ms. Allocated memory is still 213.9MB. Free memory was 184.0MB in the beginning and 182.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: Boogie Preprocessor took 23.50ms. Allocated memory is still 213.9MB. Free memory was 182.2MB in the beginning and 180.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: RCFGBuilder took 403.04ms. Allocated memory is still 213.9MB. Free memory was 180.6MB in the beginning and 160.2MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,191 INFO L158 Benchmark]: TraceAbstraction took 831930.00ms. Allocated memory was 213.9MB in the beginning and 980.4MB in the end (delta: 766.5MB). Free memory was 158.9MB in the beginning and 619.3MB in the end (delta: -460.4MB). Peak memory consumption was 595.8MB. Max. memory is 8.0GB. [2023-05-20 09:01:01,192 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.13ms. Allocated memory is still 213.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.85ms. Allocated memory is still 213.9MB. Free memory was 184.9MB in the beginning and 184.0MB in the end (delta: 885.1kB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.76ms. Allocated memory is still 213.9MB. Free memory was 184.0MB in the beginning and 182.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.50ms. Allocated memory is still 213.9MB. Free memory was 182.2MB in the beginning and 180.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.04ms. Allocated memory is still 213.9MB. Free memory was 180.6MB in the beginning and 160.2MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 831930.00ms. Allocated memory was 213.9MB in the beginning and 980.4MB in the end (delta: 766.5MB). Free memory was 158.9MB in the beginning and 619.3MB in the end (delta: -460.4MB). Peak memory consumption was 595.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4158, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 637, dependent conditional: 624, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1379, independent: 1366, independent conditional: 0, independent unconditional: 1366, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3534, independent: 2155, independent conditional: 0, independent unconditional: 2155, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1366, Positive conditional cache size: 0, Positive unconditional cache size: 1366, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: 624 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 160, Number of trivial persistent sets: 138, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1419, independent: 1406, independent conditional: 0, independent unconditional: 1406, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4158, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 637, dependent conditional: 624, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 2115, independent unconditional: 1406, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, independent: 3521, independent conditional: 0, independent unconditional: 3521, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1379, independent: 1366, independent conditional: 0, independent unconditional: 1366, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3534, independent: 2155, independent conditional: 0, independent unconditional: 2155, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 1379, Positive cache size: 1366, Positive conditional cache size: 0, Positive unconditional cache size: 1366, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: 624 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 175 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6522 for 542653ms.. - 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 175 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6522 for 542653ms.. - 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 175 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6522 for 542653ms.. - 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 175 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6522 for 542653ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 831.8s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 50.4s, 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: 217, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 189.6s InterpolantComputationTime, 2810 NumberOfCodeBlocks, 2798 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4075 ConstructedInterpolants, 43 QuantifiedInterpolants, 128209 SizeOfPredicates, 140 NumberOfNonLiveVariables, 2823 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 586/1094 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