/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.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 06:21:34,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 06:21:34,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 06:21:34,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 06:21:34,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 06:21:34,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 06:21:34,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 06:21:34,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 06:21:34,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 06:21:34,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 06:21:34,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 06:21:34,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 06:21:34,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 06:21:34,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 06:21:34,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 06:21:34,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 06:21:34,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 06:21:34,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 06:21:34,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 06:21:34,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 06:21:34,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 06:21:34,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 06:21:34,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 06:21:34,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 06:21:34,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 06:21:34,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 06:21:34,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 06:21:34,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 06:21:34,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 06:21:34,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 06:21:34,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 06:21:34,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 06:21:34,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 06:21:34,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 06:21:34,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 06:21:34,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 06:21:34,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 06:21:34,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 06:21:34,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 06:21:34,422 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 06:21:34,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 06:21:34,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 06:21:34,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 06:21:34,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 06:21:34,451 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 06:21:34,451 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 06:21:34,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 06:21:34,452 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 06:21:34,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 06:21:34,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 06:21:34,452 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 06:21:34,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 06:21:34,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 06:21:34,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 06:21:34,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 06:21:34,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 06:21:34,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 06:21:34,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 06:21:34,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 06:21:34,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 06:21:34,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 06:21:34,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 06:21:34,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 06:21:34,456 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 06:21:34,457 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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2022-11-16 06:21:34,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 06:21:34,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 06:21:34,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 06:21:34,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 06:21:34,674 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 06:21:34,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 06:21:34,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e49c4a/a458bfd5b95c4a54a3abc9463b12f2f4/FLAGc94765a86 [2022-11-16 06:21:35,106 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 06:21:35,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 06:21:35,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e49c4a/a458bfd5b95c4a54a3abc9463b12f2f4/FLAGc94765a86 [2022-11-16 06:21:35,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf6e49c4a/a458bfd5b95c4a54a3abc9463b12f2f4 [2022-11-16 06:21:35,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 06:21:35,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 06:21:35,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 06:21:35,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 06:21:35,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 06:21:35,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2433159d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35, skipping insertion in model container [2022-11-16 06:21:35,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 06:21:35,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 06:21:35,701 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-max-array-hom.wvr.c[2586,2599] [2022-11-16 06:21:35,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 06:21:35,713 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 06:21:35,751 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-max-array-hom.wvr.c[2586,2599] [2022-11-16 06:21:35,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 06:21:35,766 INFO L208 MainTranslator]: Completed translation [2022-11-16 06:21:35,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35 WrapperNode [2022-11-16 06:21:35,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 06:21:35,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 06:21:35,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 06:21:35,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 06:21:35,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,811 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-16 06:21:35,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 06:21:35,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 06:21:35,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 06:21:35,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 06:21:35,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,851 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 06:21:35,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 06:21:35,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 06:21:35,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 06:21:35,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (1/1) ... [2022-11-16 06:21:35,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 06:21:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:35,896 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 06:21:35,897 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 06:21:35,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 06:21:35,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 06:21:35,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 06:21:35,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 06:21:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 06:21:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 06:21:35,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 06:21:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 06:21:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 06:21:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 06:21:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 06:21:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 06:21:35,935 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 06:21:36,014 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 06:21:36,015 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 06:21:36,275 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 06:21:36,338 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 06:21:36,339 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 06:21:36,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 06:21:36 BoogieIcfgContainer [2022-11-16 06:21:36,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 06:21:36,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 06:21:36,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 06:21:36,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 06:21:36,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:21:35" (1/3) ... [2022-11-16 06:21:36,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5da02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:21:36, skipping insertion in model container [2022-11-16 06:21:36,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:21:35" (2/3) ... [2022-11-16 06:21:36,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba5da02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:21:36, skipping insertion in model container [2022-11-16 06:21:36,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 06:21:36" (3/3) ... [2022-11-16 06:21:36,351 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-16 06:21:36,358 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 06:21:36,372 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 06:21:36,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 06:21:36,372 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 06:21:36,456 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 06:21:36,494 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 06:21:36,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 06:21:36,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:36,497 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 06:21:36,515 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 06:21:36,534 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 06:21:36,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 06:21:36,550 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;@5e5f826b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 06:21:36,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 06:21:36,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-16 06:21:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222156462] [2022-11-16 06:21:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:37,043 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 06:21:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:37,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222156462] [2022-11-16 06:21:37,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222156462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 06:21:37,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 06:21:37,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 06:21:37,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191285047] [2022-11-16 06:21:37,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 06:21:37,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 06:21:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 06:21:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 06:21:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:37,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:21:37,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 06:21:37,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-16 06:21:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:37,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986065161] [2022-11-16 06:21:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:37,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:37,688 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 06:21:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:37,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986065161] [2022-11-16 06:21:37,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986065161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 06:21:37,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 06:21:37,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 06:21:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775852438] [2022-11-16 06:21:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 06:21:37,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 06:21:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 06:21:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-16 06:21:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,696 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:37,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:21:37,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:37,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 06:21:37,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-16 06:21:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:37,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680637788] [2022-11-16 06:21:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:37,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:38,185 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 06:21:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:38,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680637788] [2022-11-16 06:21:38,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680637788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:38,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968718078] [2022-11-16 06:21:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:38,191 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 06:21:38,192 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 06:21:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:38,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 06:21:38,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:38,602 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 06:21:38,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:38,800 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 06:21:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968718078] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:38,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 06:21:38,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 06:21:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701852965] [2022-11-16 06:21:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 06:21:38,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 06:21:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:38,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 06:21:38,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 06:21:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:38,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:38,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:21:38,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:38,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:38,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:38,952 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 06:21:39,144 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 06:21:39,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:39,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-16 06:21:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:39,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596645303] [2022-11-16 06:21:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:39,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:39,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596645303] [2022-11-16 06:21:39,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596645303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:39,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153636861] [2022-11-16 06:21:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:39,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:39,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:39,360 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 06:21:39,383 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 06:21:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:39,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 06:21:39,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:39,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:39,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153636861] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:39,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 06:21:39,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-16 06:21:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155848676] [2022-11-16 06:21:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 06:21:39,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 06:21:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 06:21:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-16 06:21:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:39,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:39,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:21:39,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:39,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:39,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:39,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:39,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:40,003 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 06:21:40,187 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 06:21:40,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-16 06:21:40,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:40,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911439506] [2022-11-16 06:21:40,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:40,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:41,810 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 06:21:41,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:41,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911439506] [2022-11-16 06:21:41,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911439506] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:41,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778837153] [2022-11-16 06:21:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:41,814 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 06:21:41,847 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 06:21:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 06:21:41,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:42,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:21:42,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 06:21:43,628 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 06:21:43,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:44,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:21:44,315 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 127 treesize of output 75 [2022-11-16 06:21:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:45,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778837153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:21:45,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:21:45,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 53 [2022-11-16 06:21:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576555856] [2022-11-16 06:21:45,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:21:45,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 06:21:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 06:21:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2248, Unknown=0, NotChecked=0, Total=2756 [2022-11-16 06:21:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:45,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.773584905660377) internal successors, (306), 53 states have internal predecessors, (306), 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 06:21:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:45,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 06:21:48,463 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 06:21:48,662 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 06:21:48,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-16 06:21:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:48,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907505323] [2022-11-16 06:21:48,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:48,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:49,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:49,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907505323] [2022-11-16 06:21:49,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907505323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:49,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188593244] [2022-11-16 06:21:49,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 06:21:49,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:49,069 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 06:21:49,098 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 06:21:49,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 06:21:49,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:21:49,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 06:21:49,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:49,526 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 06:21:49,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:49,848 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 06:21:49,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188593244] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:21:49,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:21:49,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-16 06:21:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000012234] [2022-11-16 06:21:49,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:21:49,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 06:21:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:49,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 06:21:49,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 06:21:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:49,851 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:49,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 33 states have internal predecessors, (253), 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 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-16 06:21:49,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 06:21:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 06:21:51,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 06:21:51,655 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 06:21:51,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:51,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-16 06:21:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756509720] [2022-11-16 06:21:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:51,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756509720] [2022-11-16 06:21:51,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756509720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:51,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673483608] [2022-11-16 06:21:51,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 06:21:51,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:51,855 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 06:21:51,858 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 06:21:51,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 06:21:51,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:21:51,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 06:21:51,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:52,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:52,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673483608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:21:52,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:21:52,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 06:21:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036267996] [2022-11-16 06:21:52,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:21:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 06:21:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 06:21:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-16 06:21:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:52,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:52,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 06:21:52,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:53,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:21:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 06:21:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 06:21:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:21:53,401 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 06:21:53,601 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 06:21:53,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-16 06:21:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:53,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034729536] [2022-11-16 06:21:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:53,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:54,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:54,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034729536] [2022-11-16 06:21:54,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034729536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:54,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496365726] [2022-11-16 06:21:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:54,042 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 06:21:54,044 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 06:21:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:54,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 06:21:54,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:21:54,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:54,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:21:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:21:54,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496365726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:21:54,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:21:54,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-16 06:21:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869585562] [2022-11-16 06:21:54,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:21:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 06:21:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:21:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 06:21:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 06:21:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:54,902 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:21:54,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 39 states have internal predecessors, (290), 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 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 06:21:54,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:21:54,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:21:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:21:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 06:21:56,857 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 06:21:57,053 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 06:21:57,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:21:57,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:21:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-16 06:21:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:21:57,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84819376] [2022-11-16 06:21:57,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:21:57,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:21:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:21:58,783 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 06:21:58,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:21:58,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84819376] [2022-11-16 06:21:58,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84819376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:21:58,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035503593] [2022-11-16 06:21:58,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 06:21:58,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:21:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:21:58,788 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 06:21:58,796 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 06:21:58,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 06:21:58,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:21:58,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 06:21:58,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:22:00,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:22:00,085 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 06:22:00,325 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:00,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 06:22:00,960 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 06:22:00,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:22:01,954 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse2 c_~max2~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-16 06:22:02,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:02,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 276 [2022-11-16 06:22:02,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 163 [2022-11-16 06:22:02,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 151 [2022-11-16 06:22:02,094 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 151 treesize of output 145 [2022-11-16 06:22:06,173 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 06:22:06,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035503593] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:22:06,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:22:06,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 72 [2022-11-16 06:22:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580907103] [2022-11-16 06:22:06,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:22:06,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 06:22:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:22:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 06:22:06,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=4334, Unknown=1, NotChecked=138, Total=5112 [2022-11-16 06:22:06,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:06,180 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:22:06,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.388888888888889) internal successors, (316), 72 states have internal predecessors, (316), 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 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:06,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:06,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:22:06,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 06:22:06,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 06:22:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 06:22:09,664 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 06:22:09,856 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 06:22:09,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:22:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:22:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1717655339, now seen corresponding path program 5 times [2022-11-16 06:22:09,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:22:09,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503389928] [2022-11-16 06:22:09,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:22:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:22:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:22:11,516 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 06:22:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:22:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503389928] [2022-11-16 06:22:11,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503389928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:22:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060753168] [2022-11-16 06:22:11,517 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 06:22:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:22:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:22:11,518 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 06:22:11,520 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 06:22:11,601 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 06:22:11,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:22:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 06:22:11,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:22:11,652 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 06:22:11,695 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 06:22:11,695 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 18 [2022-11-16 06:22:11,753 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 06:22:11,754 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 16 treesize of output 22 [2022-11-16 06:22:12,054 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-16 06:22:12,055 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 20 treesize of output 30 [2022-11-16 06:22:12,231 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 11 treesize of output 7 [2022-11-16 06:22:12,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 06:22:12,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:22:12,757 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 06:22:12,946 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 06:22:13,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:13,312 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 06:22:13,836 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 06:22:13,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:22:17,015 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< c_~max2~0 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0)) (.cse4 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse1)) (= .cse1 .cse0) (< 0 ~M~0) (< ~M~0 0) (<= .cse1 c_~max2~0)))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (and (or .cse4 .cse5) (or (= c_~max1~0 c_~max3~0) .cse6))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (< 0 ~M~0) (< ~M~0 0) (= .cse7 c_~max2~0) (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) .cse5) (or .cse6 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse9)) (< 0 ~M~0) (< ~M~0 0) (= .cse9 c_~max3~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))))) (or .cse4 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse11) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse13 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (= .cse13 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse14)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse14)))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse17)) (< 0 ~M~0) (< ~M~0 0) (= c_~max1~0 .cse17) (<= .cse17 c_~max2~0))))))))) is different from false [2022-11-16 06:22:18,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse4 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0) (< ~M~0 0) (not (< c_~max3~0 .cse0))))) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max1~0 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))) (and (or .cse3 .cse4) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= .cse6 c_~max2~0) (not (< c_~max1~0 .cse6)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< c_~max3~0 .cse7)) (< c_~max2~0 .cse7)))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse10 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max1~0 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0) (not (< c_~max3~0 .cse10)) (< c_~max2~0 .cse10))))) .cse3) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (= .cse11 c_~max2~0) (not (< c_~max1~0 .cse11)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) .cse4) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (= .cse13 c_~max3~0) (not (< c_~max1~0 .cse13)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) .cse5) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select .cse17 |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_293 (Array Int Int))) (let ((.cse15 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (<= .cse15 c_~max2~0) (< ~M~0 0) (= .cse15 .cse16) (not (< c_~max3~0 .cse15))))) (not (< c_~max1~0 .cse16)))))))) is different from false [2022-11-16 06:22:18,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~max2~0 c_~max3~0)) (.cse2 (<= c_~max3~0 c_~max2~0)) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< c_~max1~0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse4 c_~max2~0) (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (not (< c_~max1~0 .cse4)))))) .cse1) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse6 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse7) (< 0 ~M~0) (not (< c_~max3~0 .cse7)) (< ~M~0 0)))) (not (< c_~max1~0 .cse6)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse9 c_~max3~0) (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (not (< c_~max1~0 .cse9)))))) .cse2) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse11 .cse12) (< 0 ~M~0) (not (< c_~max3~0 .cse11)) (< ~M~0 0) (<= .cse11 c_~max2~0)))) (not (< c_~max1~0 .cse12)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse14 c_~max1~0) (< 0 ~M~0) (not (< c_~max3~0 .cse14)) (< ~M~0 0) (<= .cse14 c_~max2~0)))) (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse16) (< 0 ~M~0) (not (< c_~max3~0 .cse16)) (< ~M~0 0) (< c_~max1~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) is different from false [2022-11-16 06:22:18,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse6 (< c_~max2~0 c_~max3~0)) (.cse9 (<= c_~max3~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< c_~max3~0 .cse1)) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse1)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse5 (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 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< c_~max3~0 .cse3)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse3)))) (not (< c_~max1~0 .cse5)) (= c_~max2~0 .cse5))))) (or .cse6 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|))) (< ~M~0 0) (= c_~max2~0 .cse7)))))) (or (and (or .cse0 .cse6) (or (= c_~max1~0 c_~max3~0) .cse9)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|))) (< ~M~0 0) (< c_~max1~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< c_~max1~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< c_~max3~0 .cse12)) (< 0 ~M~0) (= c_~max1~0 .cse12) (< ~M~0 0) (<= .cse12 c_~max2~0))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< c_~max3~0 .cse13)) (< 0 ~M~0) (< ~M~0 0) (<= .cse13 c_~max2~0) (= .cse14 .cse13)))) (not (< c_~max1~0 .cse14)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse16)) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|))) (< ~M~0 0) (= c_~max3~0 .cse16))))) .cse9))) is different from false [2022-11-16 06:22:19,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:19,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-16 06:22:19,361 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 460 treesize of output 436 [2022-11-16 06:22:19,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 343 [2022-11-16 06:22:19,376 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 343 treesize of output 307 [2022-11-16 06:22:19,387 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 206 [2022-11-16 06:22:19,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:19,626 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 78 treesize of output 54 [2022-11-16 06:22:19,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,636 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,636 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 75 treesize of output 63 [2022-11-16 06:22:19,644 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,644 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 06:22:19,682 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:22:19,683 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 140 treesize of output 1 [2022-11-16 06:22:19,700 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:19,700 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 111 treesize of output 75 [2022-11-16 06:22:19,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,712 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,712 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 107 treesize of output 87 [2022-11-16 06:22:19,725 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,725 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 67 treesize of output 55 [2022-11-16 06:22:19,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:19,767 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 78 treesize of output 54 [2022-11-16 06:22:19,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,778 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,778 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 75 treesize of output 63 [2022-11-16 06:22:19,787 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,788 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 06:22:19,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:19,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-16 06:22:19,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:22:19,825 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,825 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 51 treesize of output 43 [2022-11-16 06:22:19,836 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 06:22:19,836 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 06:22:19,851 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:22:19,852 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 1 [2022-11-16 06:22:20,878 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 06:22:20,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060753168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:22:20,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:22:20,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 76 [2022-11-16 06:22:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005996244] [2022-11-16 06:22:20,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:22:20,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 06:22:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:22:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 06:22:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=4380, Unknown=21, NotChecked=572, Total=5700 [2022-11-16 06:22:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:20,888 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:22:20,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.368421052631579) internal successors, (332), 76 states have internal predecessors, (332), 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 06:22:20,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:20,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:20,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:20,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 06:22:20,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:22:42,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:22:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:42,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 06:22:43,036 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 06:22:43,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:22:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:22:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 6 times [2022-11-16 06:22:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:22:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342275671] [2022-11-16 06:22:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:22:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:22:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:22:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:22:43,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:22:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342275671] [2022-11-16 06:22:43,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342275671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:22:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486932944] [2022-11-16 06:22:43,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 06:22:43,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:22:43,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:22:43,298 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 06:22:43,324 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 06:22:43,432 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 06:22:43,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:22:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 06:22:43,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:22:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 06:22:43,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:22:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 06:22:43,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486932944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:22:43,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:22:43,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 06:22:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240175988] [2022-11-16 06:22:43,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:22:43,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 06:22:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:22:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 06:22:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-16 06:22:43,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:43,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:22:43,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:22:43,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:22:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:22:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:22:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:43,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:22:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:22:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:22:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:22:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:22:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:22:47,036 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 06:22:47,236 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 06:22:47,236 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:22:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:22:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 7 times [2022-11-16 06:22:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:22:47,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33487177] [2022-11-16 06:22:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:22:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:22:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:22:51,594 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 06:22:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:22:51,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33487177] [2022-11-16 06:22:51,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33487177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:22:51,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957466716] [2022-11-16 06:22:51,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 06:22:51,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:22:51,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:22:51,600 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 06:22:51,603 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 06:22:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:22:51,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 06:22:51,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:22:53,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:22:54,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:54,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 108 [2022-11-16 06:22:55,250 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 06:22:55,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:22:58,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:22:58,885 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 621 treesize of output 265 [2022-11-16 06:23:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:02,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957466716] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:23:02,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:23:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 33, 27] total 94 [2022-11-16 06:23:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698739048] [2022-11-16 06:23:02,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:23:02,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-11-16 06:23:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:23:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-11-16 06:23:02,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=7654, Unknown=0, NotChecked=0, Total=8742 [2022-11-16 06:23:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:02,132 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:23:02,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 4.074468085106383) internal successors, (383), 94 states have internal predecessors, (383), 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 06:23:02,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:02,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:02,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:02,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:02,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:23:02,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:23:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 06:23:13,539 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 06:23:13,734 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 06:23:13,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:23:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:23:13,734 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 8 times [2022-11-16 06:23:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:23:13,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602531803] [2022-11-16 06:23:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:23:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:23:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:23:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:23:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602531803] [2022-11-16 06:23:14,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602531803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:23:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388705024] [2022-11-16 06:23:14,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 06:23:14,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:23:14,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:23:14,016 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:23:14,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 06:23:14,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 06:23:14,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:23:14,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 06:23:14,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:23:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:14,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:23:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:14,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388705024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:23:14,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:23:14,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-16 06:23:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493871153] [2022-11-16 06:23:14,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:23:14,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 06:23:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:23:14,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 06:23:14,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 06:23:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:14,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:23:14,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.647058823529412) internal successors, (260), 34 states have internal predecessors, (260), 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 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 06:23:14,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:18,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-16 06:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:23:18,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 06:23:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 06:23:19,156 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:23:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:23:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-16 06:23:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:23:19,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226548138] [2022-11-16 06:23:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:23:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:23:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:23:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:23:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226548138] [2022-11-16 06:23:19,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226548138] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:23:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938285321] [2022-11-16 06:23:19,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 06:23:19,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:23:19,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:23:19,384 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:23:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 06:23:19,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 06:23:19,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:23:19,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 06:23:19,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:23:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 06:23:19,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:23:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 06:23:20,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938285321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:23:20,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:23:20,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 06:23:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907761161] [2022-11-16 06:23:20,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:23:20,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 06:23:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:23:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 06:23:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-16 06:23:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:20,032 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:23:20,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:23:20,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:23:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:23:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-16 06:23:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:23:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:23:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:23:25,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 06:23:25,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 06:23:25,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:23:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:23:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-16 06:23:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:23:25,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138147992] [2022-11-16 06:23:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:23:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:23:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:23:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:23:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138147992] [2022-11-16 06:23:25,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138147992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:23:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559155845] [2022-11-16 06:23:25,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:23:25,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:23:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:23:25,820 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:23:25,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 06:23:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:23:25,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 06:23:25,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:23:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:26,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:23:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:26,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559155845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:23:26,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:23:26,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 06:23:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958813498] [2022-11-16 06:23:26,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:23:26,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 06:23:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:23:26,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 06:23:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-16 06:23:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:26,451 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:23:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 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 06:23:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:26,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:23:26,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:23:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:23:26,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-16 06:23:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:23:26,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 06:23:27,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:23:27,095 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:23:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:23:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-16 06:23:27,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:23:27,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567028113] [2022-11-16 06:23:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:23:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:23:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:23:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:29,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:23:29,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567028113] [2022-11-16 06:23:29,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567028113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:23:29,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660176969] [2022-11-16 06:23:29,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 06:23:29,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:23:29,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:23:29,883 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:23:29,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 06:23:29,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 06:23:29,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:23:29,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 06:23:30,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:23:30,782 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 13 treesize of output 9 [2022-11-16 06:23:31,155 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 06:23:31,335 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 06:23:31,507 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 06:23:32,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:23:32,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:23:32,668 INFO L321 Elim1Store]: treesize reduction 28, result has 68.2 percent of original size [2022-11-16 06:23:32,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 139 [2022-11-16 06:23:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:23:34,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:25:10,181 WARN L233 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 193 DAG size of output: 166 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 06:25:47,231 WARN L233 SmtUtils]: Spent 26.83s on a formula simplification that was a NOOP. DAG size: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 06:25:49,090 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse13 (+ c_~max2~0 1))) (let ((.cse10 (= c_~max1~0 c_~max3~0)) (.cse14 (= c_~max1~0 c_~max2~0)) (.cse37 (<= c_~max3~0 c_~max2~0)) (.cse22 (<= .cse13 c_~max3~0)) (.cse4 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse7 (+ c_~A~0.offset .cse103 4)) (.cse6 (+ c_~A~0.offset .cse103))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse1 (select .cse5 .cse7)) (.cse0 (select .cse5 c_~A~0.offset)) (.cse2 (select .cse5 .cse6))) (or (not (< c_~max2~0 .cse0)) (= .cse0 .cse1) (not (< .cse2 .cse1)) (forall ((~M~0 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse3)) (< .cse4 ~M~0) (<= (+ .cse0 1) .cse3)))) (not (< c_~max1~0 .cse2)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse9 (select .cse8 c_~A~0.offset))) (or (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max2~0 .cse9)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse8 .cse7)) (< c_~max1~0 (select .cse8 .cse6)) (<= c_~max3~0 .cse9))))) .cse10) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse11 (select .cse12 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse11)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse12 .cse7)) (<= .cse13 .cse11) (< c_~max1~0 (select .cse12 .cse6)) (< c_~max2~0 (select .cse12 c_~A~0.offset)))))) .cse14) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6)) (.cse17 (select .cse16 c_~A~0.offset))) (or (= .cse15 c_~max3~0) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse15 (select .cse16 .cse7)) (not (< c_~max2~0 .cse17)) (not (< c_~max1~0 .cse15)) (<= c_~max3~0 .cse17))))) (not (< 0 ~M~0)) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset)) (.cse18 (select .cse21 .cse7))) (or (not (< c_~max1~0 .cse18)) (not (< c_~max2~0 .cse19)) (forall ((~M~0 Int)) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse20 .cse19) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse20)) (< .cse4 ~M~0) (= .cse18 .cse20)))) (< c_~max1~0 (select .cse21 .cse6)))))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse7))) (or (= .cse23 c_~max2~0) (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse23)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse24 .cse6)) (< c_~max2~0 (select .cse24 c_~A~0.offset))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse26 (select .cse28 c_~A~0.offset)) (.cse27 (select .cse28 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse25 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse25 .cse26) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse25)) (< .cse4 ~M~0) (= .cse27 .cse25)))) (< .cse27 (select .cse28 .cse7)) (not (< c_~max2~0 .cse26)) (not (< c_~max1~0 .cse27)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse29 (select .cse30 c_~A~0.offset))) (or (= .cse29 c_~max1~0) (not (< c_~max2~0 .cse29)) (< c_~max1~0 (select .cse30 .cse7)) (< c_~max1~0 (select .cse30 .cse6)) (forall ((~M~0 Int)) (let ((.cse31 (select .cse30 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse31)) (< .cse4 ~M~0) (<= (+ .cse29 1) .cse31)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse6))) (or (< .cse32 (select .cse33 .cse7)) (< c_~max2~0 (select .cse33 c_~A~0.offset)) (not (< c_~max1~0 .cse32)) (forall ((~M~0 Int)) (let ((.cse34 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse34 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse34)) (< .cse4 ~M~0) (= .cse32 .cse34)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse6))) (or (= .cse35 c_~max3~0) (< c_~max3~0 (select .cse36 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse35 (select .cse36 .cse7)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse36 c_~A~0.offset)) (not (< c_~max1~0 .cse35)))))) .cse37) (or .cse37 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse39 (select .cse38 .cse7)) (.cse40 (select .cse38 .cse6))) (or (< c_~max3~0 (select .cse38 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse39 c_~max3~0) (not (< .cse40 .cse39)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse38 c_~A~0.offset)) (not (< c_~max1~0 .cse40))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse41 (select .cse42 c_~A~0.offset))) (or (not (< c_~max2~0 .cse41)) (< c_~max1~0 (select .cse42 .cse7)) (forall ((~M~0 Int)) (let ((.cse43 (select .cse42 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse43 .cse41) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse43)) (< .cse4 ~M~0) (= c_~max1~0 .cse43)))) (< c_~max1~0 (select .cse42 .cse6)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse6))) (or (< .cse44 (select .cse45 .cse7)) (= .cse44 c_~max2~0) (< c_~max2~0 (select .cse45 c_~A~0.offset)) (not (< c_~max1~0 .cse44)) (forall ((~M~0 Int)) (let ((.cse46 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse46)) (< .cse4 ~M~0) (<= .cse13 .cse46)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse47 .cse7)) (< c_~max1~0 (select .cse47 .cse6)) (< c_~max2~0 (select .cse47 c_~A~0.offset))))) (and .cse10 .cse22) (and .cse14 .cse37)) (or .cse37 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse49 (select .cse48 .cse7))) (or (< c_~max3~0 (select .cse48 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse49 c_~max3~0) (not (< c_~max1~0 .cse49)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse48 .cse6)) (< c_~max2~0 (select .cse48 c_~A~0.offset))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse51 (select .cse50 .cse7)) (.cse53 (select .cse50 .cse6)) (.cse52 (select .cse50 c_~A~0.offset))) (or (< c_~max3~0 (select .cse50 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse51 c_~max3~0) (not (< c_~max2~0 .cse52)) (not (< .cse53 .cse51)) (not (< c_~max1~0 .cse53)) (<= c_~max3~0 .cse52))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse54 (select .cse55 .cse7)) (.cse56 (select .cse55 .cse6))) (or (= .cse54 c_~max2~0) (< c_~max3~0 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse56 .cse54)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse55 c_~A~0.offset)) (not (< c_~max1~0 .cse56)))))) .cse22) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse57 (select .cse61 c_~A~0.offset)) (.cse59 (select .cse61 .cse7)) (.cse58 (select .cse61 .cse6))) (or (not (< c_~max2~0 .cse57)) (not (< .cse58 .cse59)) (forall ((~M~0 Int)) (let ((.cse60 (select .cse61 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse60 .cse57) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse60)) (< .cse4 ~M~0) (= .cse59 .cse60)))) (not (< c_~max1~0 .cse58)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse63 (select .cse62 c_~A~0.offset)) (.cse64 (select .cse62 .cse6))) (or (< c_~max3~0 (select .cse62 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse63 1) c_~max3~0) (< .cse64 (select .cse62 .cse7)) (= .cse63 .cse64) (not (< c_~max2~0 .cse63)) (not (< c_~max1~0 .cse64)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse7)) (.cse66 (select .cse67 c_~A~0.offset))) (or (not (< c_~max1~0 .cse65)) (not (< c_~max2~0 .cse66)) (= .cse66 .cse65) (< c_~max1~0 (select .cse67 .cse6)) (forall ((~M~0 Int)) (let ((.cse68 (select .cse67 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse68)) (< .cse4 ~M~0) (<= (+ .cse66 1) .cse68)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse71 (select .cse70 c_~A~0.offset)) (.cse69 (select .cse70 .cse6))) (or (< .cse69 (select .cse70 .cse7)) (= .cse71 .cse69) (not (< c_~max2~0 .cse71)) (forall ((~M~0 Int)) (let ((.cse72 (select .cse70 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse72)) (< .cse4 ~M~0) (<= (+ .cse71 1) .cse72)))) (not (< c_~max1~0 .cse69)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse73 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse74 (select .cse73 c_~A~0.offset)) (.cse75 (select .cse73 .cse7))) (or (< c_~max3~0 (select .cse73 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse74 1) c_~max3~0) (not (< c_~max1~0 .cse75)) (not (< c_~max2~0 .cse74)) (= .cse74 .cse75) (< c_~max1~0 (select .cse73 .cse6)))))))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse76 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse77 (select .cse76 .cse6))) (or (< c_~max3~0 (select .cse76 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse77 (select .cse76 .cse7)) (< .cse4 ~M~0) (= .cse77 c_~max2~0) (< c_~max2~0 (select .cse76 c_~A~0.offset)) (not (< c_~max1~0 .cse77))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse79 (select .cse78 .cse7)) (.cse80 (select .cse78 c_~A~0.offset))) (or (< c_~max3~0 (select .cse78 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse79 c_~max3~0) (not (< c_~max1~0 .cse79)) (not (< c_~max2~0 .cse80)) (< c_~max1~0 (select .cse78 .cse6)) (<= c_~max3~0 .cse80))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse82 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse81 (select .cse82 .cse7))) (or (not (< c_~max1~0 .cse81)) (< c_~max1~0 (select .cse82 .cse6)) (< c_~max2~0 (select .cse82 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse83 (select .cse82 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse83 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse83)) (< .cse4 ~M~0) (= .cse81 .cse83)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse84 (select .cse86 .cse7)) (.cse85 (select .cse86 .cse6))) (or (= .cse84 c_~max2~0) (not (< .cse85 .cse84)) (< c_~max2~0 (select .cse86 c_~A~0.offset)) (not (< c_~max1~0 .cse85)) (forall ((~M~0 Int)) (let ((.cse87 (select .cse86 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse87)) (< .cse4 ~M~0) (<= .cse13 .cse87)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse89 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse88 (select .cse89 .cse7))) (or (= .cse88 c_~max2~0) (not (< c_~max1~0 .cse88)) (< c_~max1~0 (select .cse89 .cse6)) (< c_~max2~0 (select .cse89 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse90 (select .cse89 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse90)) (< .cse4 ~M~0) (<= .cse13 .cse90)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse92 (select .cse91 c_~A~0.offset)) (.cse93 (select .cse91 .cse7)) (.cse94 (select .cse91 .cse6))) (or (< c_~max3~0 (select .cse91 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse92 1) c_~max3~0) (not (< c_~max2~0 .cse92)) (= .cse92 .cse93) (not (< .cse94 .cse93)) (not (< c_~max1~0 .cse94)))))) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse95 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse96 (select .cse95 c_~A~0.offset))) (or (< c_~max3~0 (select .cse95 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse96 c_~max1~0) (<= (+ .cse96 1) c_~max3~0) (not (< c_~max2~0 .cse96)) (< c_~max1~0 (select .cse95 .cse7)) (< c_~max1~0 (select .cse95 .cse6)))))) (not (< 0 ~M~0)) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse98 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse97 (select .cse98 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse97 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse97)) (< .cse4 ~M~0) (= c_~max1~0 .cse97)))) (< c_~max1~0 (select .cse98 .cse7)) (< c_~max1~0 (select .cse98 .cse6)) (< c_~max2~0 (select .cse98 c_~A~0.offset))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse101 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse99 (select .cse101 .cse6)) (.cse100 (select .cse101 .cse7))) (or (not (< .cse99 .cse100)) (< c_~max2~0 (select .cse101 c_~A~0.offset)) (not (< c_~max1~0 .cse99)) (forall ((~M~0 Int)) (let ((.cse102 (select .cse101 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse102 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse102)) (< .cse4 ~M~0) (= .cse100 .cse102))))))))))) is different from false [2022-11-16 06:25:53,288 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (+ c_~max2~0 1))) (let ((.cse6 (<= c_~max3~0 c_~max2~0)) (.cse4 (<= .cse22 c_~max3~0)) (.cse3 (= c_~max1~0 c_~max3~0)) (.cse2 (+ c_~A~0.offset 4)) (.cse5 (= c_~max1~0 c_~max2~0))) (and (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< c_~max1~0 .cse0) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse1 .cse2)) (< c_~max2~0 .cse0) (< 1 ~M~0))))) (and .cse3 .cse4) (and .cse5 .cse6)) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse9 (select .cse8 .cse2))) (or (< c_~max1~0 .cse7) (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse9)) (< c_~max2~0 .cse7) (< 1 ~M~0) (= .cse9 c_~max3~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (or (not (< c_~max1~0 .cse10)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (< 1 ~M~0))) (= .cse10 c_~max2~0) (< c_~max2~0 .cse10) (< .cse10 (select .cse11 .cse2)))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset)) (.cse14 (select .cse13 .cse2))) (or (not (< c_~max1~0 .cse12)) (< c_~max3~0 (select .cse13 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse12 .cse14)) (= .cse14 c_~max2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (< c_~max1~0 .cse15) (< c_~max1~0 (select .cse16 .cse2)) (< c_~max2~0 .cse15) (forall ((~M~0 Int)) (let ((.cse17 (select .cse16 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse17 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse17)) (< 1 ~M~0) (= c_~max1~0 .cse17)))))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse2))) (or (< c_~max1~0 (select .cse18 c_~A~0.offset)) (< c_~max3~0 (select .cse18 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse19)) (= .cse19 c_~max2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse20 (select .cse23 c_~A~0.offset)) (.cse24 (select .cse23 .cse2))) (or (not (< c_~max1~0 .cse20)) (forall ((~M~0 Int)) (let ((.cse21 (select .cse23 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse21)) (<= .cse22 .cse21) (< 1 ~M~0)))) (not (< .cse20 .cse24)) (< c_~max2~0 .cse20) (= .cse24 c_~max2~0))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse25 (select .cse26 c_~A~0.offset))) (or (not (< c_~max1~0 .cse25)) (not (< 0 ~M~0)) (< c_~max2~0 .cse25) (< 1 ~M~0) (< .cse25 (select .cse26 .cse2)))))) .cse6) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse2))) (or (not (< c_~max1~0 .cse27)) (< c_~max3~0 (select .cse28 (+ c_~A~0.offset (* ~M~0 4)))) (not (< .cse27 .cse29)) (not (< c_~max2~0 .cse27)) (= .cse29 c_~max3~0))))))) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset)) (.cse32 (select .cse31 .cse2))) (or (not (< c_~max1~0 .cse30)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse30 .cse32)) (< c_~max2~0 .cse30) (< 1 ~M~0) (= .cse32 c_~max3~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse33 (select .cse34 c_~A~0.offset))) (or (<= .cse33 c_~max1~0) (<= .cse33 c_~max2~0) (<= c_~max3~0 .cse33) (< .cse33 (select .cse34 .cse2)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse35 (select .cse37 c_~A~0.offset))) (or (< c_~max1~0 .cse35) (forall ((~M~0 Int)) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse36)) (< 1 ~M~0) (<= (+ .cse35 1) .cse36)))) (< c_~max1~0 (select .cse37 .cse2)) (= .cse35 c_~max1~0) (not (< c_~max2~0 .cse35)))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse38 (select .cse39 c_~A~0.offset))) (or (not (< c_~max1~0 .cse38)) (< c_~max3~0 (select .cse39 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse38 c_~max2~0) (< c_~max2~0 .cse38) (< 1 ~M~0) (< .cse38 (select .cse39 .cse2))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse40 (select .cse41 c_~A~0.offset))) (or (< c_~max1~0 .cse40) (< c_~max3~0 (select .cse41 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse40 c_~max1~0) (<= (+ .cse40 1) c_~max3~0) (not (< c_~max2~0 .cse40)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset)) (.cse45 (select .cse44 .cse2))) (or (< c_~max1~0 .cse42) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse43)) (<= .cse22 .cse43) (< 1 ~M~0)))) (not (< c_~max1~0 .cse45)) (< c_~max2~0 .cse42) (= .cse45 c_~max2~0))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset))) (or (< c_~max1~0 .cse46) (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse47 .cse2)) (not (< c_~max2~0 .cse46)) (<= c_~max3~0 .cse46) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse48 (select .cse49 c_~A~0.offset)) (.cse50 (select .cse49 .cse2))) (or (< c_~max1~0 .cse48) (< c_~max3~0 (select .cse49 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max2~0 .cse48)) (not (< c_~max1~0 .cse50)) (= .cse50 c_~max3~0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse51 (select .cse52 c_~A~0.offset))) (or (< c_~max1~0 .cse51) (< c_~max1~0 (select .cse52 .cse2)) (not (< c_~max2~0 .cse51)) (forall ((~M~0 Int)) (let ((.cse53 (select .cse52 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse53 .cse51) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse53)) (< 1 ~M~0) (= c_~max1~0 .cse53)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse56 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (.cse54 (select .cse55 c_~A~0.offset))) (or (< c_~max1~0 .cse54) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse55 .cse2)) (not (< c_~max3~0 .cse56)) (<= .cse22 .cse56) (< c_~max2~0 .cse54) (< 1 ~M~0))))) .cse5)))) is different from false [2022-11-16 06:26:04,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ c_~max2~0 1))) (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse3 (<= c_~max3~0 c_~max2~0)) (.cse1 (<= .cse20 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max3~0)) (.cse6 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (or (and .cse0 .cse1) (and .cse2 .cse3) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse4) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse5 .cse6)) (< c_~max3~0 (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (< c_~max1~0 .cse4)))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse7) (not (< c_~max1~0 .cse7)) (< .cse7 (select .cse8 .cse6))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse9) (= c_~max2~0 .cse9) (not (< c_~max1~0 .cse9)) (< .cse9 (select .cse10 .cse6)) (forall ((~M~0 Int)) (or (not (< c_~max3~0 (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (select .cse13 .cse6))) (or (< c_~max2~0 .cse11) (not (< c_~max1~0 .cse11)) (= .cse12 c_~max3~0) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< .cse11 .cse12)) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse14 (select .cse16 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse14)) (not (< 0 ~M~0)) (<= .cse14 .cse15) (< 1 ~M~0) (= c_~max1~0 .cse14)))) (< c_~max1~0 (select .cse16 .cse6)) (not (< c_~max2~0 .cse15)) (< c_~max1~0 .cse15))))) (or .cse2 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse19 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max3~0 .cse17)) (< c_~max2~0 .cse18) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse19 .cse6)) (<= .cse20 .cse17) (< 1 ~M~0) (< c_~max1~0 .cse18)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse21 (select .cse23 .cse6)) (.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse21)) (< c_~max2~0 .cse22) (= .cse21 c_~max3~0) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse23 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (< c_~max1~0 .cse22))))) .cse3) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse24 (select .cse27 .cse6)) (.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse24)) (< c_~max2~0 .cse25) (forall ((~M~0 Int)) (let ((.cse26 (select .cse27 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse26)) (not (< 0 ~M~0)) (<= .cse20 .cse26) (< 1 ~M~0)))) (= .cse24 c_~max2~0) (< c_~max1~0 .cse25))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse29 (select .cse30 .cse6)) (.cse28 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse28)) (= .cse29 c_~max3~0) (< c_~max3~0 (select .cse30 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< .cse28 .cse29)) (not (< c_~max2~0 .cse28)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse31) (< c_~max1~0 (select .cse32 .cse6)) (forall ((~M~0 Int)) (let ((.cse33 (select .cse32 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse33)) (not (< 0 ~M~0)) (<= .cse33 c_~max2~0) (< 1 ~M~0) (= c_~max1~0 .cse33)))) (< c_~max1~0 .cse31))))) (or .cse1 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse34 (select .cse35 .cse6))) (or (not (< c_~max1~0 .cse34)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse35 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse34 c_~max2~0) (< 1 ~M~0) (< c_~max1~0 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse36 (select .cse37 .cse6)) (.cse38 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse36)) (= .cse36 c_~max3~0) (< c_~max3~0 (select .cse37 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max2~0 .cse38)) (< c_~max1~0 .cse38))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse41 (select .cse40 .cse6))) (or (not (< c_~max1~0 .cse39)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse40 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse41 c_~max2~0) (not (< .cse39 .cse41)) (< 1 ~M~0))))) .cse1) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse45 (select .cse44 .cse6))) (or (< c_~max2~0 .cse42) (not (< c_~max1~0 .cse42)) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse43)) (not (< 0 ~M~0)) (<= .cse20 .cse43) (< 1 ~M~0)))) (= .cse45 c_~max2~0) (not (< .cse42 .cse45)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~max1~0 .cse46) (forall ((~M~0 Int)) (let ((.cse47 (select .cse48 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse47)) (<= (+ .cse46 1) .cse47) (not (< 0 ~M~0)) (< 1 ~M~0)))) (< c_~max1~0 (select .cse48 .cse6)) (not (< c_~max2~0 .cse46)) (< c_~max1~0 .cse46))))) (or .cse0 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< 0 ~M~0)) (<= c_~max3~0 .cse49) (< c_~max1~0 (select .cse50 .cse6)) (< c_~max3~0 (select .cse50 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (not (< c_~max2~0 .cse49)) (< c_~max1~0 .cse49)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse51 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse51) (= c_~max2~0 .cse51) (not (< c_~max1~0 .cse51)) (not (< 0 ~M~0)) (< .cse51 (select .cse52 .cse6)) (< c_~max3~0 (select .cse52 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~max1~0 .cse53) (< c_~max3~0 (select .cse54 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (<= (+ .cse53 1) c_~max3~0) (not (< c_~max2~0 .cse53)) (< c_~max1~0 .cse53))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse55 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= .cse55 c_~max2~0) (<= c_~max3~0 .cse55) (< .cse55 (select .cse56 .cse6)) (<= .cse55 c_~max1~0)))))))) is different from false [2022-11-16 06:26:08,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:08,209 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 185 treesize of output 125 [2022-11-16 06:26:08,225 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:08,226 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 1657 treesize of output 1589 [2022-11-16 06:26:08,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:26:08,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1079 treesize of output 1031 [2022-11-16 06:26:08,285 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:08,286 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 1537 treesize of output 1349 [2022-11-16 06:26:08,330 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:08,331 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 1345 treesize of output 1253 [2022-11-16 06:26:09,416 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:26:09,416 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 174 treesize of output 1 [2022-11-16 06:26:09,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:09,435 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 122 treesize of output 86 [2022-11-16 06:26:09,453 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:09,453 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 518 treesize of output 498 [2022-11-16 06:26:09,474 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:09,474 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 494 treesize of output 434 [2022-11-16 06:26:09,493 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:09,493 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 430 treesize of output 402 [2022-11-16 06:26:09,516 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:09,516 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 257 treesize of output 245 [2022-11-16 06:26:10,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:10,035 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 208 treesize of output 136 [2022-11-16 06:26:10,057 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:10,057 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 1661 treesize of output 1589 [2022-11-16 06:26:10,093 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:10,094 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 1585 treesize of output 1397 [2022-11-16 06:26:10,129 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:10,130 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 1393 treesize of output 1301 [2022-11-16 06:26:10,164 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:10,165 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 1297 treesize of output 1253 [2022-11-16 06:26:11,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:11,370 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 173 treesize of output 113 [2022-11-16 06:26:11,390 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:11,390 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 1315 treesize of output 1259 [2022-11-16 06:26:11,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:26:11,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 751 treesize of output 715 [2022-11-16 06:26:11,439 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:11,440 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 1219 treesize of output 1079 [2022-11-16 06:26:11,498 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:11,498 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 1075 treesize of output 1007 [2022-11-16 06:26:13,057 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:26:13,057 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 148 treesize of output 1 [2022-11-16 06:26:13,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,066 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 113 treesize of output 77 [2022-11-16 06:26:13,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,078 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 377 treesize of output 359 [2022-11-16 06:26:13,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,088 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 359 treesize of output 319 [2022-11-16 06:26:13,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,097 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 319 treesize of output 299 [2022-11-16 06:26:13,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,110 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 205 treesize of output 195 [2022-11-16 06:26:13,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:26:13,482 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 150 treesize of output 102 [2022-11-16 06:26:13,507 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:13,508 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 5403 treesize of output 5183 [2022-11-16 06:26:13,580 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:13,581 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 5179 treesize of output 4607 [2022-11-16 06:26:13,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:26:13,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2795 treesize of output 2651 [2022-11-16 06:26:13,692 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:26:13,693 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 4459 treesize of output 4175 [2022-11-16 06:28:22,196 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:22,196 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 151 treesize of output 1 [2022-11-16 06:28:22,204 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:22,205 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 177 treesize of output 1 [2022-11-16 06:28:22,212 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:22,213 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 176 treesize of output 1 [2022-11-16 06:28:22,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:28:22,222 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 148 treesize of output 100 [2022-11-16 06:28:22,238 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 06:28:22,238 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 1279 treesize of output 1231 [2022-11-16 06:28:22,259 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 06:28:22,260 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 1231 treesize of output 1119 [2022-11-16 06:28:22,282 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 06:28:22,283 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 1119 treesize of output 1063 [2022-11-16 06:28:22,308 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 06:28:22,308 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 651 treesize of output 623 [2022-11-16 06:28:24,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:28:24,447 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 119 treesize of output 83 [2022-11-16 06:28:24,473 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:28:24,474 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 2101 treesize of output 2017 [2022-11-16 06:28:24,519 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:28:24,519 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 2013 treesize of output 1793 [2022-11-16 06:28:24,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:28:24,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:28:24,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 897 treesize of output 841 [2022-11-16 06:28:24,594 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 06:28:24,595 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 1733 treesize of output 1625 [2022-11-16 06:28:29,269 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,269 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 148 treesize of output 1 [2022-11-16 06:28:29,280 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,280 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 154 treesize of output 1 [2022-11-16 06:28:29,289 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,290 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 210 treesize of output 1 [2022-11-16 06:28:29,299 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,299 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 184 treesize of output 1 [2022-11-16 06:28:29,307 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,307 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 140 treesize of output 1 [2022-11-16 06:28:29,317 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 06:28:29,317 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 211 treesize of output 1 [2022-11-16 06:28:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 06:28:29,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660176969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:28:29,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:28:29,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 28] total 84 [2022-11-16 06:28:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159527488] [2022-11-16 06:28:29,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:28:29,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-16 06:28:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:28:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-16 06:28:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=5664, Unknown=52, NotChecked=480, Total=6972 [2022-11-16 06:28:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:28:29,990 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:28:29,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.392857142857143) internal successors, (369), 84 states have internal predecessors, (369), 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 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:28:29,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:28:29,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:29:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-16 06:29:32,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 06:29:32,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 06:29:32,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:29:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:29:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2017837283, now seen corresponding path program 3 times [2022-11-16 06:29:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:29:32,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710919743] [2022-11-16 06:29:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:29:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:29:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:29:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:29:32,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:29:32,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710919743] [2022-11-16 06:29:32,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710919743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:29:32,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679933380] [2022-11-16 06:29:32,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 06:29:32,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:29:32,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:29:32,767 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:29:32,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 06:29:32,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 06:29:32,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:29:32,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 06:29:32,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:29:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 06:29:33,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:29:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 06:29:33,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679933380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:29:33,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:29:33,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 36 [2022-11-16 06:29:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347673689] [2022-11-16 06:29:33,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:29:33,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 06:29:33,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:29:33,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 06:29:33,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 06:29:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:29:33,448 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:29:33,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 36 states have internal predecessors, (275), 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 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 06:29:33,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-11-16 06:29:33,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-16 06:30:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-16 06:30:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:30:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-11-16 06:30:51,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-16 06:30:51,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 06:30:51,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 06:30:51,593 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:30:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:30:51,594 INFO L85 PathProgramCache]: Analyzing trace with hash -22792143, now seen corresponding path program 3 times [2022-11-16 06:30:51,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:30:51,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909456744] [2022-11-16 06:30:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:30:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:30:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:30:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:30:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:30:51,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909456744] [2022-11-16 06:30:51,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909456744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:30:51,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379291072] [2022-11-16 06:30:51,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 06:30:51,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:30:51,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:30:51,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:30:51,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 06:30:51,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 06:30:51,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:30:51,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 06:30:51,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:30:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 06:30:52,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:30:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 06:30:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379291072] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 06:30:52,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 06:30:52,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2022-11-16 06:30:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459545753] [2022-11-16 06:30:52,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 06:30:52,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 06:30:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 06:30:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 06:30:52,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-11-16 06:30:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:52,307 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 06:30:52,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.7) internal successors, (254), 20 states have internal predecessors, (254), 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 06:30:52,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:52,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:30:52,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:30:52,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 170 states. [2022-11-16 06:30:52,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 06:30:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 06:30:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 06:30:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-11-16 06:30:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 06:30:54,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 06:30:54,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 06:30:54,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 06:30:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 06:30:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 245328404, now seen corresponding path program 4 times [2022-11-16 06:30:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 06:30:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509708986] [2022-11-16 06:30:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 06:30:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 06:30:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 06:30:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:30:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 06:30:57,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509708986] [2022-11-16 06:30:57,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509708986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 06:30:57,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581795428] [2022-11-16 06:30:57,593 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 06:30:57,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:30:57,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 06:30:57,594 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 06:30:57,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 06:30:57,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 06:30:57,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 06:30:57,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 06:30:57,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 06:31:00,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:31:00,037 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 125 treesize of output 103 [2022-11-16 06:31:01,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 06:31:01,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 06:31:01,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:31:01,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 78 [2022-11-16 06:31:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 06:31:01,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 06:31:22,454 WARN L233 SmtUtils]: Spent 17.64s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 06:31:24,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse27 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_#t~post1| 4) 4)))) (let ((.cse22 (select .cse27 (+ (* c_thread2Thread1of1ForFork0_~i~1 4) c_~A~0.offset))) (.cse8 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse11 (< c_~max1~0 .cse7))) (let ((.cse2 (= .cse7 c_~max3~0)) (.cse10 (not .cse11)) (.cse14 (= c_~max1~0 c_~max3~0)) (.cse3 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (.cse0 (< c_~max2~0 .cse22))) (and (or .cse0 (let ((.cse15 (+ c_~max2~0 1))) (let ((.cse9 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (not (< c_~max3~0 .cse16)) (<= .cse15 .cse16))))) (.cse1 (<= .cse15 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0))) (and (or (let ((.cse5 (= .cse7 c_~max2~0))) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse5)) (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse6)) (= .cse7 .cse6) (<= .cse6 c_~max2~0)))) (< .cse8 ~M~0))) (or .cse5 .cse9))) .cse10) (or .cse11 (let ((.cse13 (= c_~max1~0 c_~max2~0))) (and (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse12)) (<= .cse12 c_~max2~0) (= c_~max1~0 .cse12)))))) (or .cse13 .cse9) (or (and .cse14 .cse1) (and .cse13 .cse4) .cse3)))))))) (or (let ((.cse25 (+ .cse22 1))) (let ((.cse17 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse25 .cse26) (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (not (< c_~max3~0 .cse26)))))) (.cse20 (<= .cse25 c_~max3~0)) (.cse19 (<= c_~max3~0 .cse22))) (and (or (let ((.cse18 (= .cse22 .cse7))) (and (or .cse17 .cse18) (or (and .cse18 .cse19) (and .cse20 .cse2) .cse3) (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse21)) (<= .cse21 .cse22) (= .cse7 .cse21)))))))) .cse10) (or (let ((.cse23 (= .cse22 c_~max1~0))) (and (or .cse17 .cse23) (or (and .cse20 .cse14) .cse3 (and .cse23 .cse19)) (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse24)) (<= .cse24 .cse22) (= c_~max1~0 .cse24)))))))) .cse11)))) (not .cse0))))))) is different from false [2022-11-16 06:31:35,407 WARN L233 SmtUtils]: Spent 9.64s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 06:31:37,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 06:31:37,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 1283 treesize of output 2071 [2022-11-16 06:31:37,834 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 774 treesize of output 762 [2022-11-16 06:31:37,991 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 762 treesize of output 756 [2022-11-16 06:31:38,162 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 756 treesize of output 738 [2022-11-16 06:31:38,264 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 738 treesize of output 732 [2022-11-16 06:31:38,366 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 732 treesize of output 714 [2022-11-16 06:31:38,470 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 714 treesize of output 702 [2022-11-16 06:31:38,598 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 702 treesize of output 696 [2022-11-16 06:31:38,701 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 696 treesize of output 684 [2022-11-16 06:31:38,806 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 684 treesize of output 666 [2022-11-16 06:31:38,910 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 666 treesize of output 654 [2022-11-16 06:31:39,038 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 654 treesize of output 636 [2022-11-16 06:31:39,144 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 636 treesize of output 630 [2022-11-16 06:33:08,414 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. Received shutdown request... [2022-11-16 06:34:53,678 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-16 06:34:53,680 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 06:34:53,685 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 06:34:53,685 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 06:34:53,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 06:34:53,689 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 06:34:53,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 06:34:53,881 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. [2022-11-16 06:34:53,885 INFO L444 BasicCegarLoop]: Path program histogram: [8, 4, 3, 1, 1, 1, 1] [2022-11-16 06:34:53,887 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2022-11-16 06:34:53,888 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 06:34:53,888 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 06:34:53,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:34:53 BasicIcfg [2022-11-16 06:34:53,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 06:34:53,890 INFO L158 Benchmark]: Toolchain (without parser) took 798377.99ms. Allocated memory was 247.5MB in the beginning and 744.5MB in the end (delta: 497.0MB). Free memory was 219.2MB in the beginning and 252.9MB in the end (delta: -33.7MB). Peak memory consumption was 551.0MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,890 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 06:34:53,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 247.5MB. Free memory was 218.8MB in the beginning and 214.7MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.22ms. Allocated memory is still 247.5MB. Free memory was 214.7MB in the beginning and 213.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,891 INFO L158 Benchmark]: Boogie Preprocessor took 40.15ms. Allocated memory is still 247.5MB. Free memory was 213.1MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,891 INFO L158 Benchmark]: RCFGBuilder took 486.40ms. Allocated memory is still 247.5MB. Free memory was 211.5MB in the beginning and 190.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,891 INFO L158 Benchmark]: TraceAbstraction took 797546.73ms. Allocated memory was 247.5MB in the beginning and 744.5MB in the end (delta: 497.0MB). Free memory was 190.0MB in the beginning and 252.9MB in the end (delta: -62.9MB). Peak memory consumption was 522.7MB. Max. memory is 8.0GB. [2022-11-16 06:34:53,892 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.16ms. Allocated memory is still 197.1MB. Free memory is still 148.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.37ms. Allocated memory is still 247.5MB. Free memory was 218.8MB in the beginning and 214.7MB in the end (delta: 4.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.22ms. Allocated memory is still 247.5MB. Free memory was 214.7MB in the beginning and 213.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.15ms. Allocated memory is still 247.5MB. Free memory was 213.1MB in the beginning and 211.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 486.40ms. Allocated memory is still 247.5MB. Free memory was 211.5MB in the beginning and 190.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 797546.73ms. Allocated memory was 247.5MB in the beginning and 744.5MB in the end (delta: 497.0MB). Free memory was 190.0MB in the beginning and 252.9MB in the end (delta: -62.9MB). Peak memory consumption was 522.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 109352, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 20288, dependent conditional: 20269, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89087, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89087, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 117, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 76, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 76, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1997, independent: 1943, independent conditional: 8, independent unconditional: 1935, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1997, independent: 1933, independent conditional: 0, independent unconditional: 1933, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 60, independent conditional: 28, independent unconditional: 32, dependent: 147, dependent conditional: 88, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 89229, independent: 87121, independent conditional: 17, independent unconditional: 87104, dependent: 111, dependent conditional: 41, dependent unconditional: 70, unknown: 1997, unknown conditional: 43, unknown unconditional: 1954] , Statistics on independence cache: Total cache size (in pairs): 1997, Positive cache size: 1943, Positive conditional cache size: 8, Positive unconditional cache size: 1935, Negative cache size: 54, Negative conditional cache size: 35, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 17, Independence queries for same thread: 20265 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1631, Number of trivial persistent sets: 1399, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2298, independent: 2279, independent conditional: 0, independent unconditional: 2279, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 109352, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 20288, dependent conditional: 20269, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89087, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89087, independent: 89064, independent conditional: 86785, independent unconditional: 2279, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 117, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 76, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89229, independent: 89064, independent conditional: 25, independent unconditional: 89039, dependent: 165, dependent conditional: 76, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1997, independent: 1943, independent conditional: 8, independent unconditional: 1935, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1997, independent: 1933, independent conditional: 0, independent unconditional: 1933, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 64, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 54, dependent conditional: 35, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 60, independent conditional: 28, independent unconditional: 32, dependent: 147, dependent conditional: 88, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 89229, independent: 87121, independent conditional: 17, independent unconditional: 87104, dependent: 111, dependent conditional: 41, dependent unconditional: 70, unknown: 1997, unknown conditional: 43, unknown unconditional: 1954] , Statistics on independence cache: Total cache size (in pairs): 1997, Positive cache size: 1943, Positive conditional cache size: 8, Positive unconditional cache size: 1935, Negative cache size: 54, Negative conditional cache size: 35, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 17, Independence queries for same thread: 20265 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 37ms.. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 797.4s, OverallIterations: 19, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 200.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1075, 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.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 351.8s InterpolantComputationTime, 4404 NumberOfCodeBlocks, 4387 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6448 ConstructedInterpolants, 106 QuantifiedInterpolants, 182452 SizeOfPredicates, 272 NumberOfNonLiveVariables, 4751 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 287/603 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