/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 01:49:40,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 01:49:40,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 01:49:40,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 01:49:40,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 01:49:40,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 01:49:40,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 01:49:40,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 01:49:40,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 01:49:40,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 01:49:40,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 01:49:40,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 01:49:40,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 01:49:40,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 01:49:40,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 01:49:40,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 01:49:40,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 01:49:40,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 01:49:40,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 01:49:40,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 01:49:40,871 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 01:49:40,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 01:49:40,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 01:49:40,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 01:49:40,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 01:49:40,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 01:49:40,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 01:49:40,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 01:49:40,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 01:49:40,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 01:49:40,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 01:49:40,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 01:49:40,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 01:49:40,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 01:49:40,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 01:49:40,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 01:49:40,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 01:49:40,890 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 01:49:40,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 01:49:40,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 01:49:40,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 01:49:40,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 01:49:40,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 01:49:40,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 01:49:40,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 01:49:40,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 01:49:40,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 01:49:40,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 01:49:40,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 01:49:40,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 01:49:40,923 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 01:49:40,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 01:49:40,923 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 01:49:40,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 01:49:40,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 01:49:40,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 01:49:40,925 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:49:40,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 01:49:40,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 01:49:40,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 01:49:40,927 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 01:49:40,927 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 01:49:40,927 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2022-11-16 01:49:41,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 01:49:41,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 01:49:41,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 01:49:41,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 01:49:41,121 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 01:49:41,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-11-16 01:49:41,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c5f7dd/96db05e69c594ac4894e008c1e51d037/FLAGb6d2b3f88 [2022-11-16 01:49:41,553 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 01:49:41,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-11-16 01:49:41,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c5f7dd/96db05e69c594ac4894e008c1e51d037/FLAGb6d2b3f88 [2022-11-16 01:49:41,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa8c5f7dd/96db05e69c594ac4894e008c1e51d037 [2022-11-16 01:49:41,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 01:49:41,977 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 01:49:41,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 01:49:41,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 01:49:41,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 01:49:41,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:49:41" (1/1) ... [2022-11-16 01:49:41,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7f7c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:41, skipping insertion in model container [2022-11-16 01:49:41,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:49:41" (1/1) ... [2022-11-16 01:49:41,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 01:49:41,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 01:49:42,149 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.wvr.c[2553,2566] [2022-11-16 01:49:42,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:49:42,162 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 01:49:42,176 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.wvr.c[2553,2566] [2022-11-16 01:49:42,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 01:49:42,187 INFO L208 MainTranslator]: Completed translation [2022-11-16 01:49:42,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42 WrapperNode [2022-11-16 01:49:42,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 01:49:42,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 01:49:42,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 01:49:42,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 01:49:42,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,213 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-11-16 01:49:42,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 01:49:42,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 01:49:42,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 01:49:42,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 01:49:42,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 01:49:42,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 01:49:42,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 01:49:42,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 01:49:42,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (1/1) ... [2022-11-16 01:49:42,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 01:49:42,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:42,276 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-16 01:49:42,281 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-16 01:49:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 01:49:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 01:49:42,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 01:49:42,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 01:49:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 01:49:42,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 01:49:42,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 01:49:42,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 01:49:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 01:49:42,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 01:49:42,312 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 01:49:42,403 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 01:49:42,404 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 01:49:42,598 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 01:49:42,635 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 01:49:42,635 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 01:49:42,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:49:42 BoogieIcfgContainer [2022-11-16 01:49:42,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 01:49:42,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 01:49:42,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 01:49:42,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 01:49:42,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:49:41" (1/3) ... [2022-11-16 01:49:42,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c554d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:49:42, skipping insertion in model container [2022-11-16 01:49:42,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:49:42" (2/3) ... [2022-11-16 01:49:42,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c554d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:49:42, skipping insertion in model container [2022-11-16 01:49:42,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 01:49:42" (3/3) ... [2022-11-16 01:49:42,643 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-11-16 01:49:42,649 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 01:49:42,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 01:49:42,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 01:49:42,656 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 01:49:42,700 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 01:49:42,731 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:49:42,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 01:49:42,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:42,734 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-16 01:49:42,743 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-16 01:49:42,769 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 01:49:42,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 01:49:42,794 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;@1713f11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 01:49:42,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 01:49:43,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -990075498, now seen corresponding path program 1 times [2022-11-16 01:49:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:43,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280935025] [2022-11-16 01:49:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:43,242 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-16 01:49:43,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280935025] [2022-11-16 01:49:43,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280935025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:49:43,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:49:43,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 01:49:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687028146] [2022-11-16 01:49:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:49:43,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 01:49:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 01:49:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 01:49:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,270 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:43,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 01:49:43,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 01:49:43,319 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1421486002, now seen corresponding path program 1 times [2022-11-16 01:49:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:43,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430596498] [2022-11-16 01:49:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:43,778 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-16 01:49:43,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:43,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430596498] [2022-11-16 01:49:43,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430596498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 01:49:43,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 01:49:43,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 01:49:43,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899807228] [2022-11-16 01:49:43,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:49:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 01:49:43,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 01:49:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 01:49:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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-16 01:49:43,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 01:49:43,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1997378296, now seen corresponding path program 1 times [2022-11-16 01:49:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547310599] [2022-11-16 01:49:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:44,153 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-16 01:49:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:44,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547310599] [2022-11-16 01:49:44,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547310599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:44,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065415211] [2022-11-16 01:49:44,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:44,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:44,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:44,171 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-16 01:49:44,179 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-16 01:49:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:44,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 01:49:44,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:44,441 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-16 01:49:44,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:44,605 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-16 01:49:44,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065415211] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:44,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:49:44,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 01:49:44,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084300088] [2022-11-16 01:49:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:49:44,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 01:49:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:44,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 01:49:44,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 01:49:44,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:44,616 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:44,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 01:49:44,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:44,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:44,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:44,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:44,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 01:49:44,913 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-16 01:49:44,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:44,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -488176783, now seen corresponding path program 1 times [2022-11-16 01:49:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278801130] [2022-11-16 01:49:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:45,068 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-16 01:49:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278801130] [2022-11-16 01:49:45,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278801130] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:45,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006169568] [2022-11-16 01:49:45,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:45,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:45,072 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-16 01:49:45,100 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-16 01:49:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:45,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 01:49:45,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:45,293 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-16 01:49:45,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:45,439 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-16 01:49:45,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006169568] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:45,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 01:49:45,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-16 01:49:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764410093] [2022-11-16 01:49:45,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 01:49:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 01:49:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:45,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 01:49:45,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-16 01:49:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:45,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:45,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 01:49:45,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:45,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:45,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:45,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:45,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 01:49:45,754 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-16 01:49:45,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1789324920, now seen corresponding path program 1 times [2022-11-16 01:49:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:45,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292600399] [2022-11-16 01:49:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:46,697 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-16 01:49:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:46,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292600399] [2022-11-16 01:49:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292600399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502463896] [2022-11-16 01:49:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:46,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:46,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:46,710 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-16 01:49:46,711 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-16 01:49:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:46,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 01:49:46,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:47,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:49:47,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:49:47,895 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 36 [2022-11-16 01:49:47,978 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-16 01:49:47,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:48,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:49:48,222 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 87 treesize of output 51 [2022-11-16 01:49:48,779 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-16 01:49:48,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502463896] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:49:48,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:49:48,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-11-16 01:49:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465254852] [2022-11-16 01:49:48,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:49:48,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 01:49:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:48,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 01:49:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2716, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 01:49:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:48,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:48,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.491228070175438) internal successors, (313), 57 states have internal predecessors, (313), 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-16 01:49:48,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:48,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:48,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:48,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:48,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:49:50,992 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-16 01:49:51,185 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-16 01:49:51,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:51,186 INFO L85 PathProgramCache]: Analyzing trace with hash -250359855, now seen corresponding path program 2 times [2022-11-16 01:49:51,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:51,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256612138] [2022-11-16 01:49:51,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:51,462 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-16 01:49:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256612138] [2022-11-16 01:49:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256612138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992760959] [2022-11-16 01:49:51,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 01:49:51,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:51,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:51,481 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-16 01:49:51,482 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-16 01:49:51,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:49:51,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:49:51,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 01:49:51,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:51,947 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-16 01:49:51,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:52,184 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-16 01:49:52,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992760959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:49:52,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:49:52,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-11-16 01:49:52,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478838866] [2022-11-16 01:49:52,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:49:52,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 01:49:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 01:49:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-16 01:49:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:52,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:52,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 30 states have internal predecessors, (218), 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-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:49:52,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:49:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:49:52,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 01:49:53,072 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-16 01:49:53,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1892771466, now seen corresponding path program 1 times [2022-11-16 01:49:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:53,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266120235] [2022-11-16 01:49:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:53,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:49:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:53,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266120235] [2022-11-16 01:49:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266120235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:53,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467924984] [2022-11-16 01:49:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:53,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:53,294 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-16 01:49:53,296 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-16 01:49:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:53,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 01:49:53,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:49:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:49:53,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467924984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:49:53,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:49:53,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-11-16 01:49:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575975697] [2022-11-16 01:49:53,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:49:53,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 01:49:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 01:49:53,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-16 01:49:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:53,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:53,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 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-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:49:53,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:49:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-16 01:49:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:49:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:49:54,407 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-16 01:49:54,591 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-16 01:49:54,591 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash -165325407, now seen corresponding path program 3 times [2022-11-16 01:49:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2976915] [2022-11-16 01:49:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:54,715 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-16 01:49:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:54,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2976915] [2022-11-16 01:49:54,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2976915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:54,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922392951] [2022-11-16 01:49:54,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 01:49:54,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:54,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:54,716 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-16 01:49:54,719 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-16 01:49:54,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 01:49:54,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:49:54,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 01:49:54,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:54,930 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-16 01:49:54,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:55,025 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-16 01:49:55,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922392951] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:49:55,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:49:55,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-16 01:49:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775914922] [2022-11-16 01:49:55,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:49:55,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 01:49:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:49:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 01:49:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-16 01:49:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:55,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:49:55,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:49:55,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:49:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:49:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:49:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:49:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:49:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:49:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:49:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:49:55,986 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-16 01:49:56,172 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-16 01:49:56,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:49:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:49:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1516468592, now seen corresponding path program 4 times [2022-11-16 01:49:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:49:56,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025823298] [2022-11-16 01:49:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:49:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:49:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:49:57,093 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-16 01:49:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:49:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025823298] [2022-11-16 01:49:57,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025823298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:49:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097278936] [2022-11-16 01:49:57,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 01:49:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:49:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:49:57,095 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-16 01:49:57,098 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-16 01:49:57,170 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 01:49:57,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:49:57,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 01:49:57,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:49:58,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 01:49:58,179 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-16 01:49:58,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:49:58,486 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-16 01:49:58,827 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-16 01:49:58,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:49:59,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:49:59,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 149 [2022-11-16 01:49:59,484 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 90 treesize of output 84 [2022-11-16 01:49:59,488 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 84 treesize of output 72 [2022-11-16 01:50:00,646 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-16 01:50:00,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097278936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:50:00,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:50:00,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-11-16 01:50:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019205836] [2022-11-16 01:50:00,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:50:00,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-16 01:50:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:50:00,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-16 01:50:00,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=3933, Unknown=10, NotChecked=0, Total=4422 [2022-11-16 01:50:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:00,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:50:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.507462686567164) internal successors, (302), 67 states have internal predecessors, (302), 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-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:50:00,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:50:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 01:50:03,079 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-16 01:50:03,266 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-16 01:50:03,267 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:50:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:50:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1420844820, now seen corresponding path program 5 times [2022-11-16 01:50:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:50:03,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24939986] [2022-11-16 01:50:03,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:50:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:50:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:50:04,394 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-16 01:50:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:50:04,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24939986] [2022-11-16 01:50:04,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24939986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:50:04,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391891868] [2022-11-16 01:50:04,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 01:50:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:50:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:50:04,404 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-16 01:50:04,406 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-16 01:50:04,598 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 01:50:04,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:50:04,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 01:50:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:50:04,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 01:50:04,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 01:50:04,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 01:50:04,968 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-16 01:50:04,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 01:50:05,133 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 01:50:05,525 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-16 01:50:05,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 01:50:05,853 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-16 01:50:06,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:06,186 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-16 01:50:06,485 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-16 01:50:06,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:50:06,989 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))) is different from false [2022-11-16 01:50:09,810 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse1) (not (< .cse1 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse4 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse4))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse5 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (= .cse5 .cse6) (not (< ~M~0 c_~N~0))))) (not (< .cse6 c_~min1~0)))))))) is different from false [2022-11-16 01:50:10,376 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0))) (not (< .cse1 c_~min1~0)) (= c_~min2~0 .cse1))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (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 ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse2 .cse3) (<= (+ 2 ~M~0) c_~N~0) (not (< .cse3 c_~min2~0)) (not (< ~M~0 c_~N~0))))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse5)))) (< (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0) (< (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:50:10,489 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (not (< .cse1 c_~min1~0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse5 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse5 .cse6) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse6 c_~min2~0))))))))))) is different from false [2022-11-16 01:50:10,549 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (= c_~min2~0 .cse0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (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 (not (< .cse2 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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 (< .cse3 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse3 .cse2)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse6)))) (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (not (< 0 c_~N~0))) is different from false [2022-11-16 01:50:10,612 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (= c_~min2~0 .cse0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (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 (not (< .cse2 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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 (< .cse3 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse3 .cse2)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse6)))) (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (not (< 0 c_~N~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-16 01:50:11,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:11,241 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 88 treesize of output 64 [2022-11-16 01:50:11,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:11,248 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 317 treesize of output 307 [2022-11-16 01:50:11,253 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 280 treesize of output 232 [2022-11-16 01:50:11,258 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 232 treesize of output 208 [2022-11-16 01:50:11,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:11,268 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 170 treesize of output 166 [2022-11-16 01:50:11,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:11,557 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 54 [2022-11-16 01:50:11,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:50:11,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:50:11,566 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 01:50:11,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-11-16 01:50:11,575 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 01:50:11,575 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 43 treesize of output 37 [2022-11-16 01:50:11,604 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 01:50:11,604 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 108 treesize of output 1 [2022-11-16 01:50:11,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:11,610 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 55 treesize of output 43 [2022-11-16 01:50:11,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:50:11,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 01:50:11,619 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 01:50:11,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-16 01:50:11,625 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 01:50:11,626 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 23 treesize of output 19 [2022-11-16 01:50:12,503 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 13 treesize of output 11 [2022-11-16 01:50:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 01:50:12,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391891868] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:50:12,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:50:12,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 75 [2022-11-16 01:50:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050004475] [2022-11-16 01:50:12,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:50:12,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-16 01:50:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:50:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-16 01:50:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=4161, Unknown=40, NotChecked=834, Total=5550 [2022-11-16 01:50:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:12,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:50:12,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.053333333333334) internal successors, (304), 75 states have internal predecessors, (304), 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-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-16 01:50:12,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 01:50:12,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 01:50:12,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-16 01:50:12,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 01:50:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:23,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 01:50:23,512 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-16 01:50:23,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:50:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:50:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2006761502, now seen corresponding path program 6 times [2022-11-16 01:50:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:50:23,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418768476] [2022-11-16 01:50:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:50:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:50:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:50:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:50:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:50:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418768476] [2022-11-16 01:50:23,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418768476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:50:23,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425733751] [2022-11-16 01:50:23,672 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 01:50:23,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:50:23,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:50:23,673 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-16 01:50:23,680 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-16 01:50:23,758 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 01:50:23,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 01:50:23,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 01:50:23,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:50:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:50:23,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:50:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 01:50:24,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425733751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 01:50:24,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 01:50:24,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-11-16 01:50:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330416046] [2022-11-16 01:50:24,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 01:50:24,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 01:50:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 01:50:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 01:50:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2022-11-16 01:50:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:24,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 01:50:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.103448275862069) internal successors, (206), 29 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:24,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 01:50:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 01:50:25,068 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-16 01:50:25,261 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-16 01:50:25,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 01:50:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 01:50:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 326209330, now seen corresponding path program 7 times [2022-11-16 01:50:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 01:50:25,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338742213] [2022-11-16 01:50:25,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 01:50:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 01:50:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:50:27,586 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-16 01:50:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 01:50:27,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338742213] [2022-11-16 01:50:27,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338742213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 01:50:27,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353372335] [2022-11-16 01:50:27,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 01:50:27,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 01:50:27,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 01:50:27,588 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-16 01:50:27,589 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-16 01:50:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 01:50:27,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 01:50:27,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 01:50:29,537 INFO L321 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2022-11-16 01:50:29,538 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 177 treesize of output 108 [2022-11-16 01:50:30,080 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-16 01:50:30,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 01:50:41,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 01:50:41,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 485 treesize of output 2059 [2022-11-16 01:51:24,688 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-16 01:51:37,360 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:51:54,348 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 653 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:52:10,800 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-16 01:52:42,575 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 672 DAG size of output: 514 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:52:59,074 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:53:16,104 WARN L233 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 655 DAG size of output: 514 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:53:32,947 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:53:49,936 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 653 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:54:06,928 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-16 01:54:44,793 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 870 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:55:15,601 WARN L718 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2022-11-16 01:56:18,932 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 688 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:56:35,375 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:56:58,462 WARN L233 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 853 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:57:29,135 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-16 01:58:00,735 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 671 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:58:17,185 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:58:34,174 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 652 DAG size of output: 512 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 01:58:51,443 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-16 01:59:28,710 WARN L233 SmtUtils]: Spent 25.72s on a formula simplification. DAG size of input: 1144 DAG size of output: 1027 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 02:00:28,484 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-16 02:00:58,102 WARN L233 SmtUtils]: Spent 24.37s on a formula simplification. DAG size of input: 1127 DAG size of output: 1027 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 02:01:58,389 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-16 02:02:36,381 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 870 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 02:03:06,586 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-16 02:03:22,524 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 836 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 02:03:53,388 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. Received shutdown request... [2022-11-16 02:03:55,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 02:03:55,839 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-16 02:03:55,876 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-16 02:03:55,876 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 02:03:55,876 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-16 02:03:56,038 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-16 02:03:56,039 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while ExplicitLhsPolynomialRelations was build 27529 of 131072 xjuncts. [2022-11-16 02:03:56,043 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-16 02:03:56,044 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2022-11-16 02:03:56,045 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 02:03:56,045 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 02:03:56,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:03:56 BasicIcfg [2022-11-16 02:03:56,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 02:03:56,047 INFO L158 Benchmark]: Toolchain (without parser) took 854070.04ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 880.8MB). Free memory was 177.4MB in the beginning and 979.8MB in the end (delta: -802.4MB). Peak memory consumption was 730.2MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,047 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 02:03:56,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 203.4MB. Free memory was 176.8MB in the beginning and 172.9MB in the end (delta: 3.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.38ms. Allocated memory is still 203.4MB. Free memory was 172.9MB in the beginning and 170.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,047 INFO L158 Benchmark]: Boogie Preprocessor took 20.28ms. Allocated memory is still 203.4MB. Free memory was 170.8MB in the beginning and 169.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,047 INFO L158 Benchmark]: RCFGBuilder took 402.13ms. Allocated memory is still 203.4MB. Free memory was 169.3MB in the beginning and 148.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,048 INFO L158 Benchmark]: TraceAbstraction took 853407.81ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 880.8MB). Free memory was 147.8MB in the beginning and 979.8MB in the end (delta: -832.0MB). Peak memory consumption was 701.2MB. Max. memory is 8.0GB. [2022-11-16 02:03:56,048 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.10ms. Allocated memory is still 165.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.22ms. Allocated memory is still 203.4MB. Free memory was 176.8MB in the beginning and 172.9MB in the end (delta: 3.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.38ms. Allocated memory is still 203.4MB. Free memory was 172.9MB in the beginning and 170.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.28ms. Allocated memory is still 203.4MB. Free memory was 170.8MB in the beginning and 169.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 402.13ms. Allocated memory is still 203.4MB. Free memory was 169.3MB in the beginning and 148.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 853407.81ms. Allocated memory was 203.4MB in the beginning and 1.1GB in the end (delta: 880.8MB). Free memory was 147.8MB in the beginning and 979.8MB in the end (delta: -832.0MB). Peak memory consumption was 701.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, 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: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, 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: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 53, independent conditional: 7, independent unconditional: 47, dependent: 109, dependent conditional: 24, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1755, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2222, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, 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: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, 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: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, independent: 53, independent conditional: 7, independent unconditional: 47, dependent: 109, dependent conditional: 24, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while ExplicitLhsPolynomialRelations was build 27529 of 131072 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 853.3s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 19.3s, 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: 300, 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, 19.8s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3485 ConstructedInterpolants, 102 QuantifiedInterpolants, 35713 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 59/132 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