/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-15 23:36:29,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 23:36:29,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 23:36:29,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 23:36:29,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 23:36:29,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 23:36:29,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 23:36:29,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 23:36:29,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 23:36:29,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 23:36:29,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 23:36:29,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 23:36:29,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 23:36:29,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 23:36:29,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 23:36:29,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 23:36:29,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 23:36:29,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 23:36:29,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 23:36:29,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 23:36:29,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 23:36:29,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 23:36:29,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 23:36:29,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 23:36:29,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 23:36:29,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 23:36:29,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 23:36:29,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 23:36:29,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 23:36:29,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 23:36:29,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 23:36:29,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 23:36:29,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 23:36:29,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 23:36:29,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 23:36:29,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 23:36:29,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 23:36:29,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 23:36:29,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 23:36:29,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 23:36:29,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 23:36:29,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-15 23:36:29,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 23:36:29,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 23:36:29,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 23:36:29,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 23:36:29,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 23:36:29,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 23:36:29,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 23:36:29,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 23:36:29,912 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 23:36:29,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 23:36:29,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 23:36:29,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 23:36:29,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:36:29,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 23:36:29,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 23:36:29,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 23:36:29,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 23:36:29,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 23:36:29,916 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 23:36:29,916 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 23:36:29,916 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 [2022-11-15 23:36:30,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 23:36:30,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 23:36:30,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 23:36:30,112 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 23:36:30,112 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 23:36:30,113 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 [2022-11-15 23:36:30,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e0c4478/79e4ce46074b4b87bfcacc3a8740aabf/FLAGe445b600b [2022-11-15 23:36:30,498 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 23:36:30,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-11-15 23:36:30,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e0c4478/79e4ce46074b4b87bfcacc3a8740aabf/FLAGe445b600b [2022-11-15 23:36:30,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03e0c4478/79e4ce46074b4b87bfcacc3a8740aabf [2022-11-15 23:36:30,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 23:36:30,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 23:36:30,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 23:36:30,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 23:36:30,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 23:36:30,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36310840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30, skipping insertion in model container [2022-11-15 23:36:30,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 23:36:30,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 23:36:30,664 WARN L233 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] [2022-11-15 23:36:30,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:36:30,673 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 23:36:30,692 WARN L233 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] [2022-11-15 23:36:30,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:36:30,705 INFO L208 MainTranslator]: Completed translation [2022-11-15 23:36:30,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30 WrapperNode [2022-11-15 23:36:30,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 23:36:30,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 23:36:30,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 23:36:30,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 23:36:30,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,739 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-15 23:36:30,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 23:36:30,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 23:36:30,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 23:36:30,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 23:36:30,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,762 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 23:36:30,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 23:36:30,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 23:36:30,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 23:36:30,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (1/1) ... [2022-11-15 23:36:30,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:36:30,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:30,789 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) [2022-11-15 23:36:30,797 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 [2022-11-15 23:36:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 23:36:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-15 23:36:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-15 23:36:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-15 23:36:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-15 23:36:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 23:36:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 23:36:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 23:36:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 23:36:30,828 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 23:36:30,914 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 23:36:30,916 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 23:36:31,122 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 23:36:31,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 23:36:31,167 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-15 23:36:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:31 BoogieIcfgContainer [2022-11-15 23:36:31,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 23:36:31,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 23:36:31,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 23:36:31,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 23:36:31,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:30" (1/3) ... [2022-11-15 23:36:31,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26609327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:31, skipping insertion in model container [2022-11-15 23:36:31,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:30" (2/3) ... [2022-11-15 23:36:31,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26609327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:31, skipping insertion in model container [2022-11-15 23:36:31,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:31" (3/3) ... [2022-11-15 23:36:31,182 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-15 23:36:31,187 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 23:36:31,193 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 23:36:31,193 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-15 23:36:31,194 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 23:36:31,250 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-15 23:36:31,285 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:36:31,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 23:36:31,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:31,289 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) [2022-11-15 23:36:31,290 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 [2022-11-15 23:36:31,328 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 23:36:31,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-15 23:36:31,350 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;@74ec885e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:36:31,350 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-15 23:36:31,562 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)] === [2022-11-15 23:36:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 900810574, now seen corresponding path program 1 times [2022-11-15 23:36:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796783895] [2022-11-15 23:36:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796783895] [2022-11-15 23:36:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796783895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:36:31,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:36:31,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 23:36:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551274882] [2022-11-15 23:36:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:31,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 23:36:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 23:36:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 23:36:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:31,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:31,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:31,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:31,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 23:36:31,806 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)] === [2022-11-15 23:36:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 5295436, now seen corresponding path program 1 times [2022-11-15 23:36:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:31,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245835597] [2022-11-15 23:36:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:32,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:32,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245835597] [2022-11-15 23:36:32,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245835597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:36:32,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:36:32,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-15 23:36:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722469867] [2022-11-15 23:36:32,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:32,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-15 23:36:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-15 23:36:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-15 23:36:32,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,216 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:32,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:32,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:32,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 23:36:32,325 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)] === [2022-11-15 23:36:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1627563919, now seen corresponding path program 1 times [2022-11-15 23:36:32,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:32,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017043083] [2022-11-15 23:36:32,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:32,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:32,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017043083] [2022-11-15 23:36:32,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017043083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:32,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646792692] [2022-11-15 23:36:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:32,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:32,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:32,533 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) [2022-11-15 23:36:32,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-15 23:36:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:32,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-15 23:36:32,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:32,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:32,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646792692] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:32,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:36:32,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-15 23:36:32,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643688727] [2022-11-15 23:36:32,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:32,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-15 23:36:32,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:32,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-15 23:36:32,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-15 23:36:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,926 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:32,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:32,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:32,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:32,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:33,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-15 23:36:33,219 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 [2022-11-15 23:36:33,219 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)] === [2022-11-15 23:36:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1742110344, now seen corresponding path program 1 times [2022-11-15 23:36:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648726986] [2022-11-15 23:36:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648726986] [2022-11-15 23:36:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648726986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169161217] [2022-11-15 23:36:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:33,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:33,400 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) [2022-11-15 23:36:33,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-15 23:36:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:33,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-15 23:36:33,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:33,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:33,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169161217] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:33,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:36:33,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-15 23:36:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490503521] [2022-11-15 23:36:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:33,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-15 23:36:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-15 23:36:33,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-15 23:36:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,770 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:33,770 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) [2022-11-15 23:36:33,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:33,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:33,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:33,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-15 23:36:34,087 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 [2022-11-15 23:36:34,088 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)] === [2022-11-15 23:36:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 998227617, now seen corresponding path program 1 times [2022-11-15 23:36:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:34,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245949306] [2022-11-15 23:36:34,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:34,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:35,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:35,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245949306] [2022-11-15 23:36:35,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245949306] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457340334] [2022-11-15 23:36:35,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:35,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:35,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:35,325 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) [2022-11-15 23:36:35,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-15 23:36:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:35,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-15 23:36:35,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:36,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:36,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-15 23:36:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:37,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:38,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:38,191 INFO L350 Elim1Store]: Elim1 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 164 treesize of output 164 [2022-11-15 23:36:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:41,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457340334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:41,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:41,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 21] total 63 [2022-11-15 23:36:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813094138] [2022-11-15 23:36:41,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:41,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-15 23:36:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-15 23:36:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=3240, Unknown=0, NotChecked=0, Total=3906 [2022-11-15 23:36:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:41,302 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:41,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.111111111111111) internal successors, (322), 63 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:41,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:41,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:41,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:41,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:41,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:36:43,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:43,527 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 [2022-11-15 23:36:43,528 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)] === [2022-11-15 23:36:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1438144984, now seen corresponding path program 2 times [2022-11-15 23:36:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:43,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918587462] [2022-11-15 23:36:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:43,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918587462] [2022-11-15 23:36:43,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918587462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:43,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946452575] [2022-11-15 23:36:43,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 23:36:43,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:43,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:43,795 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) [2022-11-15 23:36:43,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-15 23:36:43,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:36:43,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:43,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-15 23:36:43,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:44,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:44,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946452575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:44,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:44,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-11-15 23:36:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483935319] [2022-11-15 23:36:44,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:44,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-15 23:36:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-15 23:36:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-15 23:36:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.3) internal successors, (219), 30 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:36:44,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:45,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 23:36:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:45,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:45,588 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 [2022-11-15 23:36:45,588 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)] === [2022-11-15 23:36:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1652224746, now seen corresponding path program 1 times [2022-11-15 23:36:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:45,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426787706] [2022-11-15 23:36:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:45,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426787706] [2022-11-15 23:36:45,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426787706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:45,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125006387] [2022-11-15 23:36:45,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:45,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:45,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:45,766 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) [2022-11-15 23:36:45,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-15 23:36:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:45,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:36:45,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:45,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:46,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125006387] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:46,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:46,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2022-11-15 23:36:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766873639] [2022-11-15 23:36:46,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-15 23:36:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:46,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-15 23:36:46,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-11-15 23:36:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:46,170 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:46,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.625) internal successors, (183), 24 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:46,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:46,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:46,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:46,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:46,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-15 23:36:46,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:46,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-15 23:36:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-15 23:36:46,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:46,825 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 [2022-11-15 23:36:46,826 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)] === [2022-11-15 23:36:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash 490899816, now seen corresponding path program 1 times [2022-11-15 23:36:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:46,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157118320] [2022-11-15 23:36:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:46,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:47,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157118320] [2022-11-15 23:36:47,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157118320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:47,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562601168] [2022-11-15 23:36:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:47,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:47,155 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) [2022-11-15 23:36:47,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-15 23:36:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:47,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-15 23:36:47,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:47,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:47,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562601168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:47,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:47,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-11-15 23:36:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062424315] [2022-11-15 23:36:47,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:47,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-15 23:36:47,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-15 23:36:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2022-11-15 23:36:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:47,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:47,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.421052631578948) internal successors, (282), 38 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:47,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:47,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:47,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-15 23:36:47,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:47,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-15 23:36:47,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:36:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:36:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:48,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:49,062 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 [2022-11-15 23:36:49,063 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)] === [2022-11-15 23:36:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -601000968, now seen corresponding path program 3 times [2022-11-15 23:36:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:49,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475031415] [2022-11-15 23:36:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:49,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475031415] [2022-11-15 23:36:49,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475031415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885064335] [2022-11-15 23:36:49,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-15 23:36:49,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:49,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:49,199 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) [2022-11-15 23:36:49,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-15 23:36:49,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-15 23:36:49,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:49,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:36:49,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:49,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:49,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885064335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:49,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:49,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-15 23:36:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543118324] [2022-11-15 23:36:49,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:49,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-15 23:36:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:49,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-15 23:36:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-15 23:36:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:49,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:49,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.24) internal successors, (231), 25 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:36:49,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:49,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:36:50,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:50,895 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 [2022-11-15 23:36:50,898 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)] === [2022-11-15 23:36:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1200311733, now seen corresponding path program 4 times [2022-11-15 23:36:50,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:50,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524391399] [2022-11-15 23:36:50,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524391399] [2022-11-15 23:36:52,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524391399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:52,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075601252] [2022-11-15 23:36:52,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-15 23:36:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:52,097 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) [2022-11-15 23:36:52,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-15 23:36:52,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-15 23:36:52,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:52,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-15 23:36:52,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:53,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:36:53,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-15 23:36:53,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:53,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-15 23:36:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:36:53,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:56,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:56,010 INFO L350 Elim1Store]: Elim1 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 276 treesize of output 276 [2022-11-15 23:36:56,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 175 [2022-11-15 23:36:56,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2022-11-15 23:36:56,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 145 [2022-11-15 23:37:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:37:00,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075601252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:37:00,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:37:00,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 74 [2022-11-15 23:37:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479611201] [2022-11-15 23:37:00,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:37:00,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-15 23:37:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:37:00,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-15 23:37:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=689, Invalid=4706, Unknown=7, NotChecked=0, Total=5402 [2022-11-15 23:37:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:00,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:37:00,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.45945945945946) internal successors, (330), 74 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:37:00,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:37:04,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-15 23:37:04,728 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 [2022-11-15 23:37:04,728 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)] === [2022-11-15 23:37:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:37:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 231166643, now seen corresponding path program 5 times [2022-11-15 23:37:04,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:37:04,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118557556] [2022-11-15 23:37:04,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:37:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:37:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:37:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:37:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:37:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118557556] [2022-11-15 23:37:06,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118557556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:37:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613560858] [2022-11-15 23:37:06,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-15 23:37:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:37:06,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:37:06,022 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) [2022-11-15 23:37:06,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-15 23:37:06,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:37:06,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:37:06,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-15 23:37:06,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:37:06,686 INFO L350 Elim1Store]: Elim1 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 [2022-11-15 23:37:07,166 INFO L350 Elim1Store]: Elim1 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 [2022-11-15 23:37:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:37:07,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-15 23:37:07,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:37:07,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-15 23:37:07,912 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:07,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-15 23:37:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:37:08,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:37:19,944 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse0 (< .cse2 c_~min1~0)) (.cse7 (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse10 c_~min2~0) (not (< ~M~0 c_~N~0)) (not (< .cse10 c_~min3~0)) (< (+ ~M~0 1) c_~N~0))))) (.cse1 (<= c_~min2~0 c_~min3~0)) (.cse4 (< c_~min3~0 c_~min2~0)) (.cse5 (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) (and (or (not .cse0) (let ((.cse3 (= c_~min2~0 .cse2))) (and (or (and (or .cse1 (= .cse2 c_~min3~0)) (or .cse3 .cse4)) .cse5) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse6) (not (< .cse6 c_~min3~0)) (= .cse2 .cse6) (< (+ ~M~0 1) c_~N~0)))) (or .cse3 .cse7)))) (or .cse0 (let ((.cse8 (= c_~min2~0 c_~min1~0))) (and (or .cse8 .cse7) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse9) (not (< .cse9 c_~min3~0)) (= c_~min1~0 .cse9) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse1 (= c_~min1~0 c_~min3~0)) (or .cse8 .cse4)) .cse5))))))) is different from false [2022-11-15 23:37:49,644 WARN L233 SmtUtils]: Spent 25.90s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:37:50,286 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse2 (= c_~min2~0 c_~min1~0)) (.cse7 (< c_~min3~0 c_~min2~0)) (.cse8 (<= c_~min2~0 c_~min3~0))) (and (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse1 c_~min3~0)) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse1) (= c_~min1~0 .cse1) (< (+ ~M~0 1) c_~N~0))))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< .cse4 c_~min3~0)) (not (< ~M~0 c_~N~0)) (< .cse4 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< .cse5 c_~min1~0)) (= c_~min2~0 .cse5) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) .cse7) (or (and (or .cse8 (= c_~min1~0 c_~min3~0)) (or .cse2 .cse7)) (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse9 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse12 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse10 c_~min3~0)) (not (< ~M~0 c_~N~0)) (< .cse10 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))) (not (< .cse12 c_~min1~0)) (= c_~min2~0 .cse12))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse14 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse13 .cse14) (not (< .cse13 c_~min3~0)) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse13) (< (+ ~M~0 1) c_~N~0)))) (not (< .cse14 c_~min1~0)))))) (or .cse8 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (not (< .cse16 c_~min1~0)) (= c_~min3~0 .cse16) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-11-15 23:37:51,559 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse7 (< c_~min3~0 c_~min2~0)) (.cse8 (<= c_~min2~0 c_~min3~0)) (.cse9 (= c_~min2~0 c_~min1~0))) (and (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< .cse1 c_~min3~0)) (= c_~min1~0 .cse1) (<= c_~min2~0 .cse1) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse2 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse3 .cse2) (not (< ~M~0 c_~N~0)) (not (< .cse3 c_~min3~0)) (<= c_~min2~0 .cse3) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (not (< .cse6 c_~min1~0)) (= c_~min2~0 .cse6) (< (+ ~M~0 1) c_~N~0))))) .cse7) (or (and (or .cse8 (= c_~min1~0 c_~min3~0)) (or .cse9 .cse7)) (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) (or .cse8 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (not (< .cse12 c_~min1~0)) (= .cse12 c_~min3~0) (< (+ ~M~0 1) c_~N~0)))))) (or .cse9 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse14 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< (select (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (not (< .cse14 c_~min3~0)) (< .cse14 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse15 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< .cse15 c_~min3~0)) (< .cse15 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))) (not (< .cse17 c_~min1~0)) (= c_~min2~0 .cse17)))))))) is different from false [2022-11-15 23:37:51,821 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse8 (< c_~min3~0 c_~min2~0)) (.cse14 (<= c_~min2~0 c_~min3~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (not (< .cse1 c_~min3~0)) (< .cse1 c_~min2~0) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse3) (not (< .cse3 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (not (< .cse4 c_~min3~0)) (< .cse4 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse6) (not (< ~M~0 c_~N~0)) (not (< .cse6 c_~min1~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) .cse8) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (not (< .cse9 c_~min3~0)) (<= c_~min2~0 .cse9) (= c_~min1~0 .cse9) (< (+ ~M~0 1) c_~N~0)))) (< (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse11 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (not (< .cse12 c_~min3~0)) (<= c_~min2~0 .cse12) (= .cse12 .cse11) (< (+ ~M~0 1) c_~N~0)))))))) (or (and (or .cse14 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse8)) (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0))))) (or .cse14 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min3~0 .cse16) (not (< ~M~0 c_~N~0)) (not (< .cse16 c_~min1~0)) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0) (< (+ ~M~0 1) c_~N~0)))))))) (not (< 0 c_~N~0))) is different from false [2022-11-15 23:37:51,945 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse2 (<= c_~min2~0 c_~min3~0)) (.cse11 (= c_~min2~0 c_~min1~0)) (.cse10 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (not (< ~M~0 c_~N~0)) (= .cse1 c_~min1~0) (<= c_~min2~0 .cse1) (< (+ ~M~0 1) c_~N~0))))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min3~0 .cse3) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse3 c_~min1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse5 c_~min1~0)) (= c_~min2~0 .cse5) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse6 c_~min3~0)) (< .cse6 c_~min2~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse9 c_~min1~0)) (not (< ~M~0 c_~N~0)) (= c_~min2~0 .cse9) (< (+ ~M~0 1) c_~N~0))))) .cse10) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse12 c_~min3~0)) (< .cse12 c_~min2~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0)))))) (or (and (or .cse2 (= c_~min1~0 c_~min3~0)) (or .cse11 .cse10)) (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse16 c_~min3~0)) (not (< ~M~0 c_~N~0)) (= .cse16 .cse15) (<= c_~min2~0 .cse16) (< (+ ~M~0 1) c_~N~0))))))))))) is different from false [2022-11-15 23:37:52,763 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (let ((.cse2 (<= c_~min2~0 c_~min3~0)) (.cse11 (= c_~min2~0 c_~min1~0)) (.cse10 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min3~0)) (not (< ~M~0 c_~N~0)) (= .cse1 c_~min1~0) (<= c_~min2~0 .cse1) (< (+ ~M~0 1) c_~N~0))))))) (or .cse2 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min3~0 .cse3) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse3 c_~min1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse5 c_~min1~0)) (= c_~min2~0 .cse5) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse6 c_~min3~0)) (< .cse6 c_~min2~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< .cse9 c_~min1~0)) (not (< ~M~0 c_~N~0)) (= c_~min2~0 .cse9) (< (+ ~M~0 1) c_~N~0))))) .cse10) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse12 c_~min3~0)) (< .cse12 c_~min2~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0)))))) (or (and (or .cse2 (= c_~min1~0 c_~min3~0)) (or .cse11 .cse10)) (forall ((~M~0 Int) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (or (< (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min3~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_320 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_320))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse15 c_~min1~0)) (forall ((~M~0 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse16 c_~min3~0)) (not (< ~M~0 c_~N~0)) (= .cse16 .cse15) (<= c_~min2~0 .cse16) (< (+ ~M~0 1) c_~N~0)))))))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-15 23:37:53,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:53,536 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 43 [2022-11-15 23:37:53,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:53,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 627 treesize of output 601 [2022-11-15 23:37:53,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 574 treesize of output 478 [2022-11-15 23:37:53,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 430 [2022-11-15 23:37:53,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:53,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 221 [2022-11-15 23:37:54,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:54,188 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 84 [2022-11-15 23:37:54,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:54,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 460 treesize of output 442 [2022-11-15 23:37:54,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 379 [2022-11-15 23:37:54,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 307 [2022-11-15 23:37:54,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:54,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 212 [2022-11-15 23:37:54,962 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:54,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-15 23:37:54,969 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:54,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 1 [2022-11-15 23:37:54,976 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:54,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2022-11-15 23:37:54,991 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:54,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-15 23:37:54,997 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:54,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-15 23:37:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:37:55,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613560858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:37:55,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:37:55,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 83 [2022-11-15 23:37:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999011743] [2022-11-15 23:37:55,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:37:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-15 23:37:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:37:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-15 23:37:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=4991, Unknown=50, NotChecked=930, Total=6806 [2022-11-15 23:37:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:55,877 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:37:55,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.819277108433735) internal successors, (317), 83 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:37:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-15 23:38:04,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:38:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-15 23:38:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:38:04,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-15 23:38:05,097 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 [2022-11-15 23:38:05,097 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)] === [2022-11-15 23:38:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:38:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1733629837, now seen corresponding path program 6 times [2022-11-15 23:38:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:38:05,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769324076] [2022-11-15 23:38:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:38:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:38:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:38:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:38:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:38:05,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769324076] [2022-11-15 23:38:05,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769324076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:38:05,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112860661] [2022-11-15 23:38:05,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-15 23:38:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:38:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:38:05,241 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) [2022-11-15 23:38:05,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-15 23:38:05,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-15 23:38:05,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:38:05,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:38:05,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:38:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:38:05,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:38:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-15 23:38:05,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112860661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:38:05,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:38:05,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-15 23:38:05,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116508511] [2022-11-15 23:38:05,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:38:05,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-15 23:38:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:38:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-15 23:38:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-15 23:38:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:05,633 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:38:05,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.458333333333333) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 23:38:05,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:38:05,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-15 23:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:38:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-15 23:38:06,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-15 23:38:06,560 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 [2022-11-15 23:38:06,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-15 23:38:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:38:06,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1033677588, now seen corresponding path program 7 times [2022-11-15 23:38:06,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:38:06,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612870165] [2022-11-15 23:38:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:38:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:38:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:38:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:38:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:38:08,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612870165] [2022-11-15 23:38:08,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612870165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:38:08,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527086817] [2022-11-15 23:38:08,605 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-15 23:38:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:38:08,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:38:08,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 23:38:08,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-15 23:38:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:38:08,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-15 23:38:08,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:38:10,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:38:10,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:38:10,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 109 [2022-11-15 23:38:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 23:38:11,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:38:26,914 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:38:40,238 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 23:39:03,278 WARN L233 SmtUtils]: Spent 22.94s on a formula simplification that was a NOOP. DAG size: 1652 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-15 23:39:03,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:39:03,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 935 treesize of output 5823 Received shutdown request... [2022-11-15 23:50:38,855 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 23:50:38,860 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 [2022-11-15 23:50:38,888 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 [2022-11-15 23:50:38,892 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-15 23:50:38,894 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-15 23:50:38,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-15 23:50:39,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-15 23:50:39,099 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. [2022-11-15 23:50:39,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-15 23:50:39,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-15 23:50:39,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-15 23:50:39,103 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2022-11-15 23:50:39,104 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 23:50:39,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 23:50:39,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:50:39 BasicIcfg [2022-11-15 23:50:39,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 23:50:39,106 INFO L158 Benchmark]: Toolchain (without parser) took 848592.51ms. Allocated memory was 127.9MB in the beginning and 783.3MB in the end (delta: 655.4MB). Free memory was 75.6MB in the beginning and 644.3MB in the end (delta: -568.7MB). Peak memory consumption was 490.0MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,106 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 92.5MB in the beginning and 92.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 23:50:39,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.07ms. Allocated memory is still 180.4MB. Free memory was 161.7MB in the beginning and 155.1MB in the end (delta: 6.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.75ms. Allocated memory is still 180.4MB. Free memory was 155.1MB in the beginning and 153.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,107 INFO L158 Benchmark]: Boogie Preprocessor took 23.68ms. Allocated memory is still 180.4MB. Free memory was 153.3MB in the beginning and 151.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,107 INFO L158 Benchmark]: RCFGBuilder took 403.41ms. Allocated memory is still 180.4MB. Free memory was 151.6MB in the beginning and 131.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,107 INFO L158 Benchmark]: TraceAbstraction took 847936.22ms. Allocated memory was 180.4MB in the beginning and 783.3MB in the end (delta: 602.9MB). Free memory was 130.6MB in the beginning and 644.3MB in the end (delta: -513.7MB). Peak memory consumption was 492.6MB. Max. memory is 8.0GB. [2022-11-15 23:50:39,108 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.09ms. Allocated memory is still 127.9MB. Free memory was 92.5MB in the beginning and 92.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.07ms. Allocated memory is still 180.4MB. Free memory was 161.7MB in the beginning and 155.1MB in the end (delta: 6.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.75ms. Allocated memory is still 180.4MB. Free memory was 155.1MB in the beginning and 153.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.68ms. Allocated memory is still 180.4MB. Free memory was 153.3MB in the beginning and 151.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.41ms. Allocated memory is still 180.4MB. Free memory was 151.6MB in the beginning and 131.3MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 847936.22ms. Allocated memory was 180.4MB in the beginning and 783.3MB in the end (delta: 602.9MB). Free memory was 130.6MB in the beginning and 644.3MB in the end (delta: -513.7MB). Peak memory consumption was 492.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45330, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 5667, dependent conditional: 5649, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39683, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39683, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 19, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 49, independent conditional: 16, independent unconditional: 33, dependent: 97, dependent conditional: 16, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39707, independent: 37703, independent conditional: 2, independent unconditional: 37701, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 9, Independence queries for same thread: 5647 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1756, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2231, independent: 2213, independent conditional: 0, independent unconditional: 2213, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 45330, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 5667, dependent conditional: 5649, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39683, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39683, independent: 39663, independent conditional: 37450, independent unconditional: 2213, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 19, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39707, independent: 39663, independent conditional: 5, independent unconditional: 39658, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1987, independent: 1960, independent conditional: 3, independent unconditional: 1957, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1987, independent: 1955, independent conditional: 0, independent unconditional: 1955, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 27, dependent conditional: 9, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 146, independent: 49, independent conditional: 16, independent unconditional: 33, dependent: 97, dependent conditional: 16, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 39707, independent: 37703, independent conditional: 2, independent unconditional: 37701, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 1987, unknown conditional: 12, unknown unconditional: 1975] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1960, Positive conditional cache size: 3, Positive unconditional cache size: 1957, Negative cache size: 27, Negative conditional cache size: 9, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 9, Independence queries for same thread: 5647 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. - 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. - 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. - 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 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 21ms.. - 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: 847.8s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 19.9s, 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: 377, 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, 0.6s SatisfiabilityAnalysisTime, 71.9s InterpolantComputationTime, 2710 NumberOfCodeBlocks, 2710 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3925 ConstructedInterpolants, 94 QuantifiedInterpolants, 52215 SizeOfPredicates, 165 NumberOfNonLiveVariables, 2887 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 100/180 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