/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 04:19:17,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 04:19:17,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 04:19:17,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 04:19:17,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 04:19:17,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 04:19:17,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 04:19:17,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 04:19:17,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 04:19:17,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 04:19:17,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 04:19:17,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 04:19:17,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 04:19:17,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 04:19:17,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 04:19:17,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 04:19:17,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 04:19:17,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 04:19:17,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 04:19:17,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 04:19:17,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 04:19:17,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 04:19:17,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 04:19:17,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 04:19:17,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 04:19:17,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 04:19:17,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 04:19:17,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 04:19:17,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 04:19:17,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 04:19:17,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 04:19:17,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 04:19:17,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 04:19:17,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 04:19:17,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 04:19:17,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 04:19:17,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 04:19:17,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 04:19:17,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 04:19:17,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 04:19:17,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 04:19:17,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistent-NoLbe.epf [2022-02-11 04:19:17,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 04:19:17,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 04:19:17,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 04:19:17,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 04:19:17,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 04:19:17,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 04:19:17,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 04:19:17,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 04:19:17,492 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 04:19:17,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 04:19:17,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 04:19:17,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 04:19:17,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 04:19:17,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 04:19:17,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 04:19:17,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 04:19:17,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 04:19:17,495 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2022-02-11 04:19:17,496 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-11 04:19:17,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 04:19:17,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 04:19:17,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 04:19:17,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 04:19:17,727 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 04:19:17,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-02-11 04:19:17,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85ba655a/90dedd04ed20473c88b5de9333a7f8f1/FLAG8ea0f62de [2022-02-11 04:19:18,120 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 04:19:18,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-02-11 04:19:18,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85ba655a/90dedd04ed20473c88b5de9333a7f8f1/FLAG8ea0f62de [2022-02-11 04:19:18,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e85ba655a/90dedd04ed20473c88b5de9333a7f8f1 [2022-02-11 04:19:18,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 04:19:18,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 04:19:18,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 04:19:18,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 04:19:18,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 04:19:18,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7e4bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18, skipping insertion in model container [2022-02-11 04:19:18,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 04:19:18,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 04:19:18,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-02-11 04:19:18,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 04:19:18,304 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 04:19:18,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2553,2566] [2022-02-11 04:19:18,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 04:19:18,329 INFO L208 MainTranslator]: Completed translation [2022-02-11 04:19:18,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18 WrapperNode [2022-02-11 04:19:18,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 04:19:18,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 04:19:18,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 04:19:18,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 04:19:18,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,363 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-02-11 04:19:18,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 04:19:18,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 04:19:18,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 04:19:18,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 04:19:18,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 04:19:18,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 04:19:18,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 04:19:18,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 04:19:18,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (1/1) ... [2022-02-11 04:19:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 04:19:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:18,445 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-02-11 04:19:18,447 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-02-11 04:19:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 04:19:18,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-11 04:19:18,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-11 04:19:18,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-02-11 04:19:18,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 04:19:18,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 04:19:18,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-11 04:19:18,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 04:19:18,471 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 04:19:18,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 04:19:18,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 04:19:18,859 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 04:19:18,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 04:19:18,922 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-11 04:19:18,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 04:19:18 BoogieIcfgContainer [2022-02-11 04:19:18,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 04:19:18,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 04:19:18,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 04:19:18,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 04:19:18,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 04:19:18" (1/3) ... [2022-02-11 04:19:18,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548be4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 04:19:18, skipping insertion in model container [2022-02-11 04:19:18,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 04:19:18" (2/3) ... [2022-02-11 04:19:18,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548be4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 04:19:18, skipping insertion in model container [2022-02-11 04:19:18,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 04:19:18" (3/3) ... [2022-02-11 04:19:18,932 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-02-11 04:19:18,936 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 04:19:18,936 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 04:19:18,936 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-11 04:19:18,936 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 04:19:18,978 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,978 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,978 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,979 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,979 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,979 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,979 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,979 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,980 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,981 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,982 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,983 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,984 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,985 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,986 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,987 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,988 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,988 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,988 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,988 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,988 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,989 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,994 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,995 WARN L322 ript$VariableManager]: TermVariable thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,995 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,995 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,995 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,995 WARN L322 ript$VariableManager]: TermVariable |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,996 WARN L322 ript$VariableManager]: TermVariable |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:18,997 WARN L322 ript$VariableManager]: TermVariable |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 04:19:19,000 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-02-11 04:19:19,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 04:19:19,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:19,035 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-02-11 04:19:19,038 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-02-11 04:19:19,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 04:19:19,068 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 04:19:19,069 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-11 04:19:19,283 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1497474230, now seen corresponding path program 1 times [2022-02-11 04:19:19,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:19,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136627310] [2022-02-11 04:19:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:19,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:19,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136627310] [2022-02-11 04:19:19,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136627310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 04:19:19,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 04:19:19,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 04:19:19,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094026090] [2022-02-11 04:19:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 04:19:19,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 04:19:19,503 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 04:19:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 04:19:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:19,523 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:19,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 04:19:19,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:19,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-11 04:19:19,558 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2025109570, now seen corresponding path program 1 times [2022-02-11 04:19:19,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:19,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550715706] [2022-02-11 04:19:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:19,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:19,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:19,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550715706] [2022-02-11 04:19:19,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550715706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 04:19:19,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 04:19:19,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-11 04:19:19,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222970877] [2022-02-11 04:19:19,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 04:19:19,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-11 04:19:19,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-11 04:19:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-11 04:19:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:19,866 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:19,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 04:19:19,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:19,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:20,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-11 04:19:20,010 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1393754728, now seen corresponding path program 1 times [2022-02-11 04:19:20,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:20,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437036246] [2022-02-11 04:19:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:20,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:20,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437036246] [2022-02-11 04:19:20,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437036246] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:20,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691775118] [2022-02-11 04:19:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:20,205 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-02-11 04:19:20,206 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-02-11 04:19:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:20,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-11 04:19:20,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:20,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:20,847 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691775118] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:20,847 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-11 04:19:20,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-02-11 04:19:20,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718434298] [2022-02-11 04:19:20,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 04:19:20,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-11 04:19:20,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:20,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-11 04:19:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-11 04:19:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,849 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:20,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 04:19:20,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:20,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:20,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:20,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-11 04:19:21,139 WARN L452 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-02-11 04:19:21,140 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 572069471, now seen corresponding path program 1 times [2022-02-11 04:19:21,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:21,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501645905] [2022-02-11 04:19:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:21,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:21,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501645905] [2022-02-11 04:19:21,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501645905] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:21,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001927642] [2022-02-11 04:19:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:21,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:21,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:21,249 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-02-11 04:19:21,250 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-02-11 04:19:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:21,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 04:19:21,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:21,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:21,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001927642] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:21,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-11 04:19:21,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-02-11 04:19:21,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498188632] [2022-02-11 04:19:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 04:19:21,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-11 04:19:21,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-11 04:19:21,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-11 04:19:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:21,851 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:21,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 04:19:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:21,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:21,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 04:19:21,985 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-02-11 04:19:22,185 WARN L452 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-02-11 04:19:22,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1687310332, now seen corresponding path program 1 times [2022-02-11 04:19:22,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:22,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668502606] [2022-02-11 04:19:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:22,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:22,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668502606] [2022-02-11 04:19:22,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668502606] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:22,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958994079] [2022-02-11 04:19:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:22,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:22,756 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-02-11 04:19:22,792 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-02-11 04:19:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:22,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-11 04:19:22,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:23,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-11 04:19:24,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:19:24,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:19:24,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:19:24,915 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:24,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-02-11 04:19:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:25,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:26,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (and (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset))) (or (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse1 (< .cse2 c_~min2~0))) (and (or (= c_~min2~0 .cse0) .cse1) (or (not .cse1) (= .cse2 .cse0))))) (not (< .cse0 c_~min1~0)))))) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) c_~A~0.base))) (or (< (select .cse4 c_~A~0.offset) c_~min1~0) (let ((.cse5 (select .cse4 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse6 (< .cse5 c_~min2~0))) (and (or (= .cse5 c_~min1~0) (not .cse6)) (or (= c_~min2~0 c_~min1~0) .cse6)))))))))) is different from false [2022-02-11 04:19:34,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_127 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (let ((.cse0 (< .cse1 c_~min2~0))) (and (or (not .cse0) (= .cse1 c_~min1~0)) (or (= c_~min2~0 c_~min1~0) .cse0)))) (< (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_127 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_129) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (let ((.cse4 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (let ((.cse3 (< .cse4 c_~min2~0))) (and (or (not .cse3) (= .cse4 .cse5)) (or .cse3 (= c_~min2~0 .cse5))))) (not (< .cse5 c_~min1~0))))))))) is different from false [2022-02-11 04:19:37,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 209 [2022-02-11 04:19:37,713 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2593 treesize of output 2497 [2022-02-11 04:19:37,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2452 treesize of output 2273 [2022-02-11 04:19:37,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2260 treesize of output 2177 [2022-02-11 04:19:37,840 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2164 treesize of output 2129 [2022-02-11 04:19:37,873 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2116 treesize of output 1969 [2022-02-11 04:19:37,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1956 treesize of output 1929 [2022-02-11 04:19:37,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:19:37,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1916 treesize of output 1849 [2022-02-11 04:19:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:19:50,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958994079] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:19:50,063 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:19:50,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 33, 28] total 72 [2022-02-11 04:19:50,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718585487] [2022-02-11 04:19:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:19:50,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-02-11 04:19:50,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-02-11 04:19:50,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=4082, Unknown=66, NotChecked=274, Total=5112 [2022-02-11 04:19:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:50,066 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:50,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.305555555555555) internal successors, (310), 72 states have internal predecessors, (310), 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-02-11 04:19:50,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:50,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:50,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:50,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 04:19:50,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 04:19:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-11 04:19:52,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-11 04:19:53,174 WARN L452 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-02-11 04:19:53,175 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:53,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:53,176 INFO L85 PathProgramCache]: Analyzing trace with hash 366841983, now seen corresponding path program 2 times [2022-02-11 04:19:53,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:53,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277365824] [2022-02-11 04:19:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:53,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:53,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:53,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277365824] [2022-02-11 04:19:53,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277365824] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:53,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412169057] [2022-02-11 04:19:53,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 04:19:53,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:53,398 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-02-11 04:19:53,399 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-02-11 04:19:53,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 04:19:53,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:19:53,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-11 04:19:53,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:53,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:54,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412169057] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:19:54,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:19:54,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-02-11 04:19:54,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233839183] [2022-02-11 04:19:54,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:19:54,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-11 04:19:54,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-11 04:19:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2022-02-11 04:19:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:54,315 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:54,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.794117647058823) internal successors, (265), 34 states have internal predecessors, (265), 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-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-02-11 04:19:54,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:55,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:19:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-11 04:19:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-11 04:19:55,356 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-02-11 04:19:55,539 WARN L452 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-02-11 04:19:55,540 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -118201969, now seen corresponding path program 1 times [2022-02-11 04:19:55,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:55,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399149270] [2022-02-11 04:19:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:55,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:55,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399149270] [2022-02-11 04:19:55,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399149270] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:55,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212665457] [2022-02-11 04:19:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:55,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:55,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:55,693 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-02-11 04:19:55,697 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-02-11 04:19:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:55,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-11 04:19:55,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:56,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:56,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212665457] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:19:56,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:19:56,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2022-02-11 04:19:56,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313989793] [2022-02-11 04:19:56,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:19:56,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-11 04:19:56,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:56,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-11 04:19:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2022-02-11 04:19:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:56,517 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:56,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.085714285714285) internal successors, (248), 35 states have internal predecessors, (248), 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-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-11 04:19:56,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-11 04:19:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-11 04:19:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-11 04:19:57,039 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-02-11 04:19:57,220 WARN L452 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-02-11 04:19:57,220 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2126029821, now seen corresponding path program 3 times [2022-02-11 04:19:57,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:57,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546150174] [2022-02-11 04:19:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:57,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:57,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:57,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546150174] [2022-02-11 04:19:57,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546150174] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:57,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453597288] [2022-02-11 04:19:57,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 04:19:57,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:57,325 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-02-11 04:19:57,357 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-02-11 04:19:57,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-11 04:19:57,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:19:57,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-11 04:19:57,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:19:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:57,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:19:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-11 04:19:57,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453597288] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:19:57,810 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:19:57,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-02-11 04:19:57,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858937203] [2022-02-11 04:19:57,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:19:57,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-11 04:19:57,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:19:57,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-11 04:19:57,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-02-11 04:19:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:57,812 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:19:57,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.72) internal successors, (218), 25 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 04:19:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:57,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:57,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:19:57,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-02-11 04:19:57,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-02-11 04:19:57,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-02-11 04:19:57,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:19:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:19:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:19:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:19:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:19:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:19:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:19:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-11 04:19:59,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-11 04:19:59,819 WARN L452 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-02-11 04:19:59,820 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:19:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:19:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 453874005, now seen corresponding path program 4 times [2022-02-11 04:19:59,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:19:59,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768867915] [2022-02-11 04:19:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:19:59,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:19:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:19:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:19:59,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:19:59,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768867915] [2022-02-11 04:19:59,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768867915] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:19:59,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459259064] [2022-02-11 04:19:59,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-11 04:19:59,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:19:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:19:59,898 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-02-11 04:19:59,899 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-02-11 04:19:59,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-11 04:19:59,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:19:59,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-11 04:19:59,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:00,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:00,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459259064] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:00,484 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:00,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-02-11 04:20:00,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123185016] [2022-02-11 04:20:00,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:00,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-11 04:20:00,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:00,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-11 04:20:00,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-02-11 04:20:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:00,485 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:00,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.416666666666667) internal successors, (178), 24 states have internal predecessors, (178), 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-02-11 04:20:00,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:00,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:00,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-02-11 04:20:00,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-11 04:20:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:01,059 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-02-11 04:20:01,259 WARN L452 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-02-11 04:20:01,259 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1314850242, now seen corresponding path program 5 times [2022-02-11 04:20:01,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:01,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426726551] [2022-02-11 04:20:01,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:02,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:02,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426726551] [2022-02-11 04:20:02,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426726551] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:02,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885372147] [2022-02-11 04:20:02,889 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-11 04:20:02,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:02,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:02,890 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-02-11 04:20:02,890 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-02-11 04:20:02,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-02-11 04:20:02,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:02,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-11 04:20:02,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:20:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:20:05,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:20:05,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-02-11 04:20:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:06,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:09,618 INFO L353 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2022-02-11 04:20:09,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 383 treesize of output 155 [2022-02-11 04:20:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:11,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885372147] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:11,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:11,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33, 27] total 82 [2022-02-11 04:20:11,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324815607] [2022-02-11 04:20:11,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:11,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-11 04:20:11,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:11,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-11 04:20:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=6118, Unknown=0, NotChecked=0, Total=6642 [2022-02-11 04:20:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:11,018 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:11,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 4.280487804878049) internal successors, (351), 82 states have internal predecessors, (351), 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-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:16,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-02-11 04:20:16,175 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-02-11 04:20:16,358 WARN L452 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-02-11 04:20:16,359 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1701214599, now seen corresponding path program 6 times [2022-02-11 04:20:16,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:16,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426794749] [2022-02-11 04:20:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:16,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:16,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426794749] [2022-02-11 04:20:16,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426794749] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:16,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270241372] [2022-02-11 04:20:16,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-11 04:20:16,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:16,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:16,568 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-02-11 04:20:16,569 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-02-11 04:20:16,682 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-02-11 04:20:16,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:16,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-11 04:20:16,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:17,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:17,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270241372] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:17,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:17,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2022-02-11 04:20:17,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710960576] [2022-02-11 04:20:17,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:17,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-11 04:20:17,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:17,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-11 04:20:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2022-02-11 04:20:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:17,633 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:17,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.0) internal successors, (240), 40 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-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2022-02-11 04:20:17,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-02-11 04:20:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:19,114 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-02-11 04:20:19,296 WARN L452 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-02-11 04:20:19,296 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash -737055773, now seen corresponding path program 2 times [2022-02-11 04:20:19,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:19,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862873566] [2022-02-11 04:20:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:19,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:19,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862873566] [2022-02-11 04:20:19,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862873566] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:19,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324076434] [2022-02-11 04:20:19,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 04:20:19,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:19,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:19,414 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-02-11 04:20:19,415 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-02-11 04:20:19,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 04:20:19,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:19,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-11 04:20:19,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-11 04:20:19,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-11 04:20:19,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324076434] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:19,923 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:19,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 25 [2022-02-11 04:20:19,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204671051] [2022-02-11 04:20:19,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:19,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-11 04:20:19,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:19,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-11 04:20:19,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-02-11 04:20:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:19,925 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:19,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.28) internal successors, (207), 25 states have internal predecessors, (207), 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-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:19,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-11 04:20:20,802 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-02-11 04:20:20,985 WARN L452 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-02-11 04:20:20,985 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:20,985 INFO L85 PathProgramCache]: Analyzing trace with hash 925880532, now seen corresponding path program 1 times [2022-02-11 04:20:20,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:20,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270437468] [2022-02-11 04:20:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:22,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:22,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270437468] [2022-02-11 04:20:22,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270437468] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:22,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148177803] [2022-02-11 04:20:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:22,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:22,175 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-02-11 04:20:22,176 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-02-11 04:20:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:22,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-11 04:20:22,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:23,901 INFO L353 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2022-02-11 04:20:23,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 81 [2022-02-11 04:20:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:24,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:26,674 INFO L353 Elim1Store]: treesize reduction 39, result has 55.7 percent of original size [2022-02-11 04:20:26,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 165 [2022-02-11 04:20:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:30,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148177803] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:30,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:30,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 24] total 68 [2022-02-11 04:20:30,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890869464] [2022-02-11 04:20:30,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:30,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-02-11 04:20:30,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-02-11 04:20:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=4144, Unknown=0, NotChecked=0, Total=4556 [2022-02-11 04:20:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:30,642 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:30,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.911764705882353) internal successors, (334), 68 states have internal predecessors, (334), 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-02-11 04:20:30,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:30,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:30,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-02-11 04:20:30,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-11 04:20:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-11 04:20:33,525 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-02-11 04:20:33,709 WARN L452 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-02-11 04:20:33,709 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:33,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 304688963, now seen corresponding path program 2 times [2022-02-11 04:20:33,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:33,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650730636] [2022-02-11 04:20:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-11 04:20:33,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:33,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650730636] [2022-02-11 04:20:33,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650730636] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:33,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93846148] [2022-02-11 04:20:33,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 04:20:33,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:33,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:33,841 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-02-11 04:20:33,875 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-02-11 04:20:33,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 04:20:33,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:33,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-11 04:20:33,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-11 04:20:34,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-11 04:20:34,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93846148] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:34,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:34,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 28 [2022-02-11 04:20:34,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692888403] [2022-02-11 04:20:34,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:34,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-11 04:20:34,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:34,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-11 04:20:34,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2022-02-11 04:20:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:34,402 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:34,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.107142857142858) internal successors, (227), 28 states have internal predecessors, (227), 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-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:34,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-02-11 04:20:34,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-11 04:20:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-11 04:20:35,883 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-02-11 04:20:36,067 WARN L452 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-02-11 04:20:36,067 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -310458454, now seen corresponding path program 3 times [2022-02-11 04:20:36,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:36,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384529063] [2022-02-11 04:20:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:36,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:37,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:37,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384529063] [2022-02-11 04:20:37,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384529063] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:37,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386151640] [2022-02-11 04:20:37,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 04:20:37,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:37,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:37,601 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-02-11 04:20:37,601 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-02-11 04:20:37,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-11 04:20:37,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:37,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-11 04:20:37,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:39,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-11 04:20:39,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:20:39,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:20:39,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 152 treesize of output 81 [2022-02-11 04:20:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:40,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:42,488 INFO L353 Elim1Store]: treesize reduction 39, result has 55.7 percent of original size [2022-02-11 04:20:42,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 165 [2022-02-11 04:20:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:44,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386151640] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:44,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:44,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 24] total 76 [2022-02-11 04:20:44,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536141038] [2022-02-11 04:20:44,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:44,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-02-11 04:20:44,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-02-11 04:20:44,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=5242, Unknown=0, NotChecked=0, Total=5700 [2022-02-11 04:20:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:44,352 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:44,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.605263157894737) internal successors, (350), 76 states have internal predecessors, (350), 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-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-11 04:20:44,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-11 04:20:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-11 04:20:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-11 04:20:48,540 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-02-11 04:20:48,739 WARN L452 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-02-11 04:20:48,739 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:48,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 447158407, now seen corresponding path program 4 times [2022-02-11 04:20:48,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:48,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559702887] [2022-02-11 04:20:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-11 04:20:48,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:48,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559702887] [2022-02-11 04:20:48,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559702887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:48,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181076558] [2022-02-11 04:20:48,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-11 04:20:48,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:48,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:48,856 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-02-11 04:20:48,884 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-02-11 04:20:48,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-11 04:20:48,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:20:48,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-11 04:20:48,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-11 04:20:49,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:20:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-11 04:20:49,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181076558] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:20:49,559 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:20:49,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-02-11 04:20:49,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080665578] [2022-02-11 04:20:49,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:20:49,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-02-11 04:20:49,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:20:49,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-02-11 04:20:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-02-11 04:20:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:49,561 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:20:49,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.235294117647059) internal successors, (212), 34 states have internal predecessors, (212), 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-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-11 04:20:49,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-11 04:20:49,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:20:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:20:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:20:52,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:20:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-11 04:20:52,023 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-02-11 04:20:52,205 WARN L452 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-02-11 04:20:52,206 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:20:52,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:20:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1703067208, now seen corresponding path program 7 times [2022-02-11 04:20:52,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:20:52,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276690362] [2022-02-11 04:20:52,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:20:52,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:20:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:54,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:20:54,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276690362] [2022-02-11 04:20:54,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276690362] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:20:54,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364924000] [2022-02-11 04:20:54,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-11 04:20:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:20:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:20:54,030 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-02-11 04:20:54,030 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-02-11 04:20:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:20:54,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-11 04:20:54,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:20:54,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:20:54,373 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 04:20:54,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 04:20:55,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2022-02-11 04:20:56,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:20:56,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:20:56,689 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 04:20:56,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 110 [2022-02-11 04:20:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:20:57,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:21:03,000 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-02-11 04:21:03,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 835 treesize of output 621 [2022-02-11 04:21:03,059 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-02-11 04:21:03,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 546 treesize of output 494 [2022-02-11 04:21:03,089 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-02-11 04:21:03,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 467 treesize of output 387 [2022-02-11 04:21:09,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-11 04:21:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:21:09,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364924000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 04:21:09,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 04:21:09,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34, 33] total 90 [2022-02-11 04:21:09,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516935619] [2022-02-11 04:21:09,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 04:21:09,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-02-11 04:21:09,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 04:21:09,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-02-11 04:21:09,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=7591, Unknown=16, NotChecked=0, Total=8010 [2022-02-11 04:21:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:21:09,347 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 04:21:09,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 3.9) internal successors, (351), 90 states have internal predecessors, (351), 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-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-02-11 04:21:09,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-11 04:21:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-11 04:21:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-11 04:21:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 04:21:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-11 04:21:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-11 04:21:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-11 04:21:12,668 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-02-11 04:21:12,852 WARN L452 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-02-11 04:21:12,852 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-02-11 04:21:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 04:21:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash -738271038, now seen corresponding path program 8 times [2022-02-11 04:21:12,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 04:21:12,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308236648] [2022-02-11 04:21:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 04:21:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 04:21:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 04:21:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:21:14,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 04:21:14,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308236648] [2022-02-11 04:21:14,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308236648] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 04:21:14,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200748650] [2022-02-11 04:21:14,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 04:21:14,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 04:21:14,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 04:21:14,266 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-02-11 04:21:14,267 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-02-11 04:21:14,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 04:21:14,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 04:21:14,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-11 04:21:14,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 04:21:14,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:21:14,441 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-11 04:21:14,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-02-11 04:21:14,495 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-11 04:21:14,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-02-11 04:21:14,849 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 04:21:14,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-02-11 04:21:15,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-11 04:21:15,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-11 04:21:15,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:21:15,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-11 04:21:16,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-11 04:21:16,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2022-02-11 04:21:17,156 INFO L353 Elim1Store]: treesize reduction 51, result has 37.8 percent of original size [2022-02-11 04:21:17,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 185 treesize of output 108 [2022-02-11 04:21:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 04:21:18,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 04:21:56,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_596 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) c_~A~0.base))) (let ((.cse28 (select .cse27 c_~A~0.offset))) (or (let ((.cse0 (< (select .cse27 (+ c_~A~0.offset 4)) .cse28))) (and (or .cse0 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse1 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse2 (* ~M~0 4))) (or (< (select .cse1 (+ c_~A~0.offset .cse2)) c_~min2~0) (let ((.cse5 (select .cse1 (+ c_~A~0.offset .cse2 4)))) (let ((.cse4 (< .cse5 c_~min2~0)) (.cse3 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (and (or (= c_~min2~0 .cse3) .cse4) (or (not .cse4) (= .cse3 .cse5))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse13 (* ~M~0 4))) (let ((.cse7 (select .cse12 (+ c_~A~0.offset .cse13)))) (or (not (< .cse7 c_~min2~0)) (let ((.cse9 (select .cse12 (+ c_~A~0.offset .cse13 4)))) (let ((.cse10 (< .cse9 .cse7)) (.cse8 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (and (or (= .cse8 .cse9) (not .cse10)) (or .cse10 (= .cse8 .cse7)))))))))))) (or (not .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse14 (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse15 (* ~M~0 4))) (or (< (select .cse14 (+ c_~A~0.offset .cse15)) c_~min2~0) (let ((.cse18 (select .cse14 (+ c_~A~0.offset .cse15 4)))) (let ((.cse17 (select (select .cse19 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse16 (< .cse18 c_~min2~0))) (and (or (not .cse16) (= .cse17 .cse18)) (or (= c_~min2~0 .cse17) .cse16)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse26 (* ~M~0 4))) (let ((.cse20 (select .cse25 (+ c_~A~0.offset .cse26)))) (or (not (< .cse20 c_~min2~0)) (let ((.cse23 (select .cse25 (+ c_~A~0.offset .cse26 4)))) (let ((.cse22 (select (select .cse24 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse21 (< .cse23 .cse20))) (and (or .cse21 (= .cse22 .cse20)) (or (= .cse22 .cse23) (not .cse21)))))))))))))) (not (< .cse28 c_~min1~0)))))) (forall ((v_ArrVal_596 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) c_~A~0.base))) (or (< (select .cse29 c_~A~0.offset) c_~min1~0) (let ((.cse43 (< (select .cse29 (+ c_~A~0.offset 4)) c_~min1~0))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse30 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse31 (* ~M~0 4))) (or (< (select .cse30 (+ c_~A~0.offset .cse31)) c_~min2~0) (let ((.cse34 (select .cse30 (+ c_~A~0.offset .cse31 4)))) (let ((.cse33 (select (select .cse35 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse32 (< .cse34 c_~min2~0))) (and (or (not .cse32) (= .cse33 .cse34)) (or (= c_~min2~0 .cse33) .cse32)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse41 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse42 (* ~M~0 4))) (let ((.cse36 (select .cse41 (+ c_~A~0.offset .cse42)))) (or (not (< .cse36 c_~min2~0)) (let ((.cse39 (select .cse41 (+ c_~A~0.offset .cse42 4)))) (let ((.cse38 (select (select .cse40 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse37 (< .cse39 .cse36))) (and (or .cse37 (= .cse38 .cse36)) (or (= .cse38 .cse39) (not .cse37))))))))))) (not .cse43)) (or .cse43 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse45 (* ~M~0 4))) (or (< (select .cse44 (+ c_~A~0.offset .cse45)) c_~min2~0) (let ((.cse47 (select .cse44 (+ c_~A~0.offset .cse45 4)))) (let ((.cse46 (< .cse47 c_~min2~0))) (and (or (= c_~min2~0 c_~min1~0) .cse46) (or (not .cse46) (= c_~min1~0 .cse47)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse52 (* ~M~0 4))) (let ((.cse48 (select .cse51 (+ c_~A~0.offset .cse52)))) (or (not (< .cse48 c_~min2~0)) (let ((.cse50 (select .cse51 (+ c_~A~0.offset .cse52 4)))) (let ((.cse49 (< .cse50 .cse48))) (and (or (= c_~min1~0 .cse48) .cse49) (or (= c_~min1~0 .cse50) (not .cse49))))))))))))))))))) is different from false [2022-02-11 04:23:35,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) c_~A~0.base))) (let ((.cse28 (select .cse27 c_~A~0.offset))) (or (let ((.cse13 (< (select .cse27 (+ c_~A~0.offset 4)) .cse28))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse0 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse1 (* ~M~0 4))) (or (< (select .cse0 (+ c_~A~0.offset .cse1)) c_~min2~0) (let ((.cse4 (select .cse0 (+ c_~A~0.offset .cse1 4)))) (let ((.cse3 (select (select .cse5 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse2 (< .cse4 c_~min2~0))) (and (or (not .cse2) (= .cse3 .cse4)) (or (= .cse3 c_~min2~0) .cse2)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse11 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse12 (* ~M~0 4))) (let ((.cse8 (select .cse11 (+ c_~A~0.offset .cse12)))) (or (let ((.cse9 (select .cse11 (+ c_~A~0.offset .cse12 4)))) (let ((.cse7 (select (select .cse10 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse6 (< .cse9 .cse8))) (and (or .cse6 (= .cse7 .cse8)) (or (= .cse7 .cse9) (not .cse6))))) (not (< .cse8 c_~min2~0)))))))) (not .cse13)) (or .cse13 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse19 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse20 (* ~M~0 4))) (let ((.cse15 (select .cse19 (+ c_~A~0.offset .cse20)))) (or (let ((.cse17 (select .cse19 (+ c_~A~0.offset .cse20 4)))) (let ((.cse14 (select (select .cse18 c_~A~0.base) c_~A~0.offset)) (.cse16 (< .cse17 .cse15))) (and (or (= .cse14 .cse15) .cse16) (or (= .cse14 .cse17) (not .cse16))))) (not (< .cse15 c_~min2~0))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse26 (* ~M~0 4))) (or (let ((.cse23 (select .cse25 (+ c_~A~0.offset .cse26 4)))) (let ((.cse22 (select (select .cse24 c_~A~0.base) c_~A~0.offset)) (.cse21 (< .cse23 c_~min2~0))) (and (or .cse21 (= c_~min2~0 .cse22)) (or (= .cse22 .cse23) (not .cse21))))) (< (select .cse25 (+ c_~A~0.offset .cse26)) c_~min2~0))))))))) (not (< .cse28 c_~min1~0)))))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) c_~A~0.base))) (or (< (select .cse29 c_~A~0.offset) c_~min1~0) (let ((.cse30 (< (select .cse29 (+ c_~A~0.offset 4)) c_~min1~0))) (and (or .cse30 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse32 (* ~M~0 4))) (or (< (select .cse31 (+ c_~A~0.offset .cse32)) c_~min2~0) (let ((.cse34 (select .cse31 (+ c_~A~0.offset .cse32 4)))) (let ((.cse33 (< .cse34 c_~min2~0))) (and (or (= c_~min2~0 c_~min1~0) .cse33) (or (not .cse33) (= c_~min1~0 .cse34)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse39 (* ~M~0 4))) (let ((.cse35 (select .cse38 (+ c_~A~0.offset .cse39)))) (or (not (< .cse35 c_~min2~0)) (let ((.cse36 (select .cse38 (+ c_~A~0.offset .cse39 4)))) (let ((.cse37 (< .cse36 .cse35))) (and (or (= c_~min1~0 .cse36) (not .cse37)) (or .cse37 (= c_~min1~0 .cse35))))))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse40 (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse41 (* ~M~0 4))) (or (< (select .cse40 (+ c_~A~0.offset .cse41)) c_~min2~0) (let ((.cse44 (select .cse40 (+ c_~A~0.offset .cse41 4)))) (let ((.cse43 (select (select .cse45 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse42 (< .cse44 c_~min2~0))) (and (or (not .cse42) (= .cse43 .cse44)) (or (= .cse43 c_~min2~0) .cse42)))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse51 (select (store .cse50 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) c_~A~0.base)) (.cse52 (* ~M~0 4))) (let ((.cse48 (select .cse51 (+ c_~A~0.offset .cse52)))) (or (let ((.cse49 (select .cse51 (+ c_~A~0.offset .cse52 4)))) (let ((.cse47 (select (select .cse50 c_~A~0.base) (+ c_~A~0.offset 4))) (.cse46 (< .cse49 .cse48))) (and (or .cse46 (= .cse47 .cse48)) (or (= .cse47 .cse49) (not .cse46))))) (not (< .cse48 c_~min2~0)))))))) (not .cse30)))))))) (<= (+ ~M~0 1) 0) (< 0 ~M~0))) is different from false [2022-02-11 04:26:18,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse0 (select .cse28 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse0 c_~min1~0)) (let ((.cse1 (< (select .cse28 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) .cse0))) (and (or .cse1 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse8 (* ~M~0 4))) (let ((.cse2 (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8)))) (or (not (< .cse2 c_~min2~0)) (let ((.cse5 (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse8 4)))) (let ((.cse4 (< .cse5 .cse2)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (or (= .cse2 .cse3) .cse4) (or (not .cse4) (= .cse3 .cse5)))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse13 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse14 (* ~M~0 4))) (or (let ((.cse11 (select .cse13 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse14 4)))) (let ((.cse10 (< .cse11 c_~min2~0)) (.cse9 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (or (= c_~min2~0 .cse9) .cse10) (or (not .cse10) (= .cse9 .cse11))))) (< (select .cse13 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse14)) c_~min2~0))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse19 (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse20 (* ~M~0 4))) (or (let ((.cse17 (select .cse19 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse20 4)))) (let ((.cse16 (< .cse17 c_~min2~0)) (.cse15 (select (select .cse18 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)))) (and (or (= c_~min2~0 .cse15) .cse16) (or (not .cse16) (= .cse15 .cse17))))) (< (select .cse19 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse20)) c_~min2~0))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse26 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse27 (* ~M~0 4))) (let ((.cse24 (select .cse26 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse27)))) (or (let ((.cse23 (select .cse26 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse27 4)))) (let ((.cse21 (< .cse23 .cse24)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)))) (and (or (not .cse21) (= .cse22 .cse23)) (or .cse21 (= .cse24 .cse22))))) (not (< .cse24 c_~min2~0)))))))) (not .cse1)))))))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (let ((.cse29 (< (select .cse52 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)) c_~min1~0))) (and (or (not .cse29) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse34 (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse35 (* ~M~0 4))) (or (let ((.cse32 (select .cse34 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse35 4)))) (let ((.cse31 (< .cse32 c_~min2~0)) (.cse30 (select (select .cse33 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)))) (and (or (= c_~min2~0 .cse30) .cse31) (or (not .cse31) (= .cse30 .cse32))))) (< (select .cse34 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse35)) c_~min2~0))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse41 (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse42 (* ~M~0 4))) (let ((.cse39 (select .cse41 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse42)))) (or (let ((.cse38 (select .cse41 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse42 4)))) (let ((.cse36 (< .cse38 .cse39)) (.cse37 (select (select .cse40 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| 4)))) (and (or (not .cse36) (= .cse37 .cse38)) (or .cse36 (= .cse39 .cse37))))) (not (< .cse39 c_~min2~0))))))))) (or .cse29 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse47 (* ~M~0 4))) (let ((.cse43 (select .cse46 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse47)))) (or (not (< .cse43 c_~min2~0)) (let ((.cse45 (select .cse46 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse47 4)))) (let ((.cse44 (< .cse45 .cse43))) (and (or (= .cse43 c_~min1~0) .cse44) (or (not .cse44) (= c_~min1~0 .cse45))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_#t~ret12#1.base|)) (.cse51 (* ~M~0 4))) (or (let ((.cse49 (select .cse50 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse51 4)))) (let ((.cse48 (< .cse49 c_~min2~0))) (and (or (not .cse48) (= c_~min1~0 .cse49)) (or (= c_~min2~0 c_~min1~0) .cse48)))) (< (select .cse50 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| .cse51)) c_~min2~0)))))))) (< (select .cse52 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0))))))) is different from false [2022-02-11 04:26:51,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (let ((.cse0 (< (select .cse27 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) .cse28))) (and (or (not .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse6 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse7 (* ~M~0 4))) (let ((.cse1 (select .cse6 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse1 c_~min2~0)) (let ((.cse4 (select .cse6 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse2 (< .cse4 .cse1)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (and (or .cse2 (= .cse3 .cse1)) (or (not .cse2) (= .cse3 .cse4)))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse13 (* ~M~0 4))) (or (let ((.cse10 (select .cse12 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse8 (< .cse10 c_~min2~0))) (and (or (not .cse8) (= .cse9 .cse10)) (or (= c_~min2~0 .cse9) .cse8)))) (< (select .cse12 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse18 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse19 (* ~M~0 4))) (or (let ((.cse15 (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse16 (< .cse15 c_~min2~0)) (.cse14 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (or (= .cse14 .cse15) (not .cse16)) (or .cse16 (= c_~min2~0 .cse14))))) (< (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse25 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse26 (* ~M~0 4))) (let ((.cse21 (select .cse25 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (let ((.cse23 (select .cse25 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse20 (< .cse23 .cse21))) (and (or .cse20 (= .cse21 .cse22)) (or (= .cse22 .cse23) (not .cse20))))) (not (< .cse21 c_~min2~0)))))))) .cse0))) (not (< .cse28 c_~min1~0)))))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (let ((.cse30 (< (select .cse29 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~min1~0))) (and (or (not .cse30) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse36 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse37 (* ~M~0 4))) (let ((.cse31 (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< .cse31 c_~min2~0)) (let ((.cse34 (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse32 (< .cse34 .cse31)) (.cse33 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (and (or .cse32 (= .cse33 .cse31)) (or (not .cse32) (= .cse33 .cse34)))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse42 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse43 (* ~M~0 4))) (or (let ((.cse40 (select .cse42 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (.cse38 (< .cse40 c_~min2~0))) (and (or (not .cse38) (= .cse39 .cse40)) (or (= c_~min2~0 .cse39) .cse38)))) (< (select .cse42 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))))) (or .cse30 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse47 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse48 (* ~M~0 4))) (let ((.cse46 (select .cse47 (+ .cse48 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (let ((.cse45 (select .cse47 (+ .cse48 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse44 (< .cse45 .cse46))) (and (or (not .cse44) (= c_~min1~0 .cse45)) (or .cse44 (= c_~min1~0 .cse46))))) (not (< .cse46 c_~min2~0)))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse52 (* ~M~0 4))) (or (let ((.cse50 (select .cse51 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)))) (let ((.cse49 (< .cse50 c_~min2~0))) (and (or (= c_~min2~0 c_~min1~0) .cse49) (or (not .cse49) (= c_~min1~0 .cse50))))) (< (select .cse51 (+ .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0)))))))))))) (<= (+ ~M~0 1) 0) (< 0 ~M~0))) is different from false [2022-02-11 04:27:05,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse0 (< (select .cse23 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min1~0))) (and (or .cse0 (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse5 (* ~M~0 4))) (let ((.cse3 (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse1 (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse2 (< .cse1 .cse3))) (and (or (= c_~min1~0 .cse1) (not .cse2)) (or .cse2 (= c_~min1~0 .cse3))))) (not (< .cse3 c_~min2~0)))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (* ~M~0 4))) (or (< (select .cse6 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse9 (select .cse6 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse8 (< .cse9 c_~min2~0))) (and (or (= c_~min2~0 c_~min1~0) .cse8) (or (not .cse8) (= c_~min1~0 .cse9)))))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse15 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (* ~M~0 4))) (let ((.cse10 (select .cse15 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse10 c_~min2~0)) (let ((.cse11 (select .cse15 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse13 (< .cse11 .cse10)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (= .cse11 .cse12) (not .cse13)) (or .cse13 (= .cse10 .cse12)))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse21 (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse22 (* ~M~0 4))) (or (let ((.cse19 (select .cse21 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse17 (< .cse19 c_~min2~0)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or .cse17 (= c_~min2~0 .cse18)) (or (not .cse17) (= .cse19 .cse18))))) (< (select .cse21 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))) (not .cse0)))) (< (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse24 c_~min1~0)) (let ((.cse38 (< (select .cse52 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse24))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse30 (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse31 (* ~M~0 4))) (let ((.cse28 (select .cse30 (+ .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse25 (select .cse30 (+ .cse31 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse27 (< .cse25 .cse28)) (.cse26 (select (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (= .cse25 .cse26) (not .cse27)) (or .cse27 (= .cse28 .cse26))))) (not (< .cse28 c_~min2~0))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse36 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse37 (* ~M~0 4))) (or (let ((.cse34 (select .cse36 (+ .cse37 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse33 (< .cse34 c_~min2~0)) (.cse32 (select (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (= c_~min2~0 .cse32) .cse33) (or (not .cse33) (= .cse34 .cse32))))) (< (select .cse36 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))) .cse38) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse44 (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse45 (* ~M~0 4))) (let ((.cse39 (select .cse44 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse39 c_~min2~0)) (let ((.cse40 (select .cse44 (+ .cse45 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse42 (< .cse40 .cse39)) (.cse41 (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (= .cse40 .cse41) (not .cse42)) (or .cse42 (= .cse39 .cse41)))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse49 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse50 (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse51 (* ~M~0 4))) (or (let ((.cse48 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse46 (< .cse48 c_~min2~0)) (.cse47 (select (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or .cse46 (= c_~min2~0 .cse47)) (or (not .cse46) (= .cse48 .cse47))))) (< (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0)))))) (not .cse38))))))))))) is different from false [2022-02-11 04:28:51,444 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse0 (< (select .cse23 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min1~0))) (and (or (not .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse6 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (* ~M~0 4))) (let ((.cse1 (select .cse6 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min2~0)) (let ((.cse2 (select .cse6 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse4 (< .cse2 .cse1))) (and (or (= .cse2 .cse3) (not .cse4)) (or (= .cse3 .cse1) .cse4))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse8 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (* ~M~0 4))) (or (< (select .cse8 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse11 (select .cse8 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse10 (< .cse11 c_~min2~0)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (not .cse10) (= .cse11 .cse12)) (or .cse10 (= c_~min2~0 .cse12))))))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (* ~M~0 4))) (let ((.cse14 (select .cse17 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse14 c_~min2~0)) (let ((.cse16 (select .cse17 (+ .cse18 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse15 (< .cse16 .cse14))) (and (or (= c_~min1~0 .cse14) .cse15) (or (not .cse15) (= .cse16 c_~min1~0))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse19 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse20 (* ~M~0 4))) (or (< (select .cse19 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse22 (select .cse19 (+ .cse20 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse21 (< .cse22 c_~min2~0))) (and (or (not .cse21) (= .cse22 c_~min1~0)) (or (= c_~min2~0 c_~min1~0) .cse21)))))))) .cse0))) (< (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (let ((.cse37 (< (select .cse51 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse52))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse29 (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse30 (* ~M~0 4))) (let ((.cse24 (select .cse29 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse24 c_~min2~0)) (let ((.cse25 (select .cse29 (+ .cse30 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse27 (< .cse25 .cse24))) (and (or (= .cse25 .cse26) (not .cse27)) (or (= .cse26 .cse24) .cse27))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse31 (select (store .cse36 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse32 (* ~M~0 4))) (or (< (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse34 (select .cse31 (+ .cse32 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse33 (< .cse34 c_~min2~0)) (.cse35 (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (and (or (not .cse33) (= .cse34 .cse35)) (or .cse33 (= c_~min2~0 .cse35)))))))))) (not .cse37)) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse38 (select (store .cse43 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse39 (* ~M~0 4))) (or (< (select .cse38 (+ .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse42 (select .cse38 (+ .cse39 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse40 (< .cse42 c_~min2~0)) (.cse41 (select (select .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or .cse40 (= c_~min2~0 .cse41)) (or (not .cse40) (= .cse42 .cse41))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse49 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse50 (* ~M~0 4))) (let ((.cse44 (select .cse49 (+ .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse44 c_~min2~0)) (let ((.cse46 (select .cse49 (+ .cse50 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse45 (< .cse46 .cse44))) (and (or (not .cse45) (= .cse46 .cse47)) (or (= .cse47 .cse44) .cse45)))))))))) .cse37))) (not (< .cse52 c_~min1~0))))))))) is different from false [2022-02-11 04:29:57,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (and (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (let ((.cse10 (< (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min1~0))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse4 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse5 (* ~M~0 4))) (let ((.cse1 (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse1 c_~min2~0)) (let ((.cse3 (select .cse4 (+ .cse5 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse2 (< .cse3 .cse1))) (and (or (= c_~min1~0 .cse1) .cse2) (or (= c_~min1~0 .cse3) (not .cse2))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse8 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse9 (* ~M~0 4))) (or (let ((.cse7 (select .cse8 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse6 (< .cse7 c_~min2~0))) (and (or (not .cse6) (= c_~min1~0 .cse7)) (or (= c_~min2~0 c_~min1~0) .cse6)))) (< (select .cse8 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) .cse10) (or (not .cse10) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse16 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse17 (* ~M~0 4))) (let ((.cse11 (select .cse16 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse11 c_~min2~0)) (let ((.cse13 (select .cse16 (+ .cse17 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse14 (< .cse13 .cse11))) (and (or (= .cse12 .cse13) (not .cse14)) (or (= .cse12 .cse11) .cse14))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse18 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse19 (* ~M~0 4))) (or (< (select .cse18 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse21 (select .cse18 (+ .cse19 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse22 (< .cse21 c_~min2~0))) (and (or (= .cse20 .cse21) (not .cse22)) (or (= c_~min2~0 .cse20) .cse22))))))))))))))) (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse24 c_~min1~0)) (let ((.cse25 (< (select .cse52 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse24))) (and (or (not .cse25) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse31 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse32 (* ~M~0 4))) (let ((.cse26 (select .cse31 (+ .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse26 c_~min2~0)) (let ((.cse28 (select .cse31 (+ .cse32 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse27 (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse29 (< .cse28 .cse26))) (and (or (= .cse27 .cse28) (not .cse29)) (or (= .cse27 .cse26) .cse29))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse33 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse34 (* ~M~0 4))) (or (< (select .cse33 (+ .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse36 (select .cse33 (+ .cse34 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse35 (select (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse37 (< .cse36 c_~min2~0))) (and (or (= .cse35 .cse36) (not .cse37)) (or (= c_~min2~0 .cse35) .cse37)))))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse39 (select (store .cse44 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse40 (* ~M~0 4))) (or (< (select .cse39 (+ .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0) (let ((.cse43 (select .cse39 (+ .cse40 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse41 (select (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse42 (< .cse43 c_~min2~0))) (and (or (= c_~min2~0 .cse41) .cse42) (or (= .cse41 .cse43) (not .cse42))))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |c_ULTIMATE.start_create_fresh_int_array_#t~post23#1| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse50 (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse51 (* ~M~0 4))) (let ((.cse45 (select .cse50 (+ .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse45 c_~min2~0)) (let ((.cse48 (select .cse50 (+ .cse51 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse46 (select (select .cse49 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse47 (< .cse48 .cse45))) (and (or (= .cse45 .cse46) .cse47) (or (= .cse46 .cse48) (not .cse47))))))))))) .cse25)))))))) (< 0 ~M~0))) is different from false [2022-02-11 04:30:13,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (and (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse0 (< (select .cse23 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min1~0))) (and (or (not .cse0) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse6 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (* ~M~0 4))) (let ((.cse2 (select .cse6 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse4 (select .cse6 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse3 (< .cse4 .cse2))) (and (or (= .cse1 .cse2) .cse3) (or (= .cse1 .cse4) (not .cse3))))) (not (< .cse2 c_~min2~0))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse12 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse13 (* ~M~0 4))) (or (let ((.cse10 (select .cse12 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse8 (< .cse10 c_~min2~0))) (and (or .cse8 (= .cse9 c_~min2~0)) (or (= .cse9 .cse10) (not .cse8))))) (< (select .cse12 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))))) (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse17 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (* ~M~0 4))) (let ((.cse16 (select .cse17 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse14 (select .cse17 (+ .cse18 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse15 (< .cse14 .cse16))) (and (or (= c_~min1~0 .cse14) (not .cse15)) (or (= c_~min1~0 .cse16) .cse15)))) (not (< .cse16 c_~min2~0)))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse21 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse22 (* ~M~0 4))) (or (let ((.cse19 (select .cse21 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse20 (< .cse19 c_~min2~0))) (and (or (= c_~min1~0 .cse19) (not .cse20)) (or (= c_~min2~0 c_~min1~0) .cse20)))) (< (select .cse21 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) .cse0))) (< (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_593 Int) (v_ArrVal_595 (Array Int Int)) (v_ArrVal_596 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (let ((.cse37 (< (select .cse51 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse52))) (and (or (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse28 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse29 (* ~M~0 4))) (or (let ((.cse26 (select .cse28 (+ .cse29 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse24 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse25 (< .cse26 c_~min2~0))) (and (or (= c_~min2~0 .cse24) .cse25) (or (= .cse26 .cse24) (not .cse25))))) (< (select .cse28 (+ .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse35 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse36 (* ~M~0 4))) (let ((.cse33 (select .cse35 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse30 (select .cse35 (+ .cse36 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse31 (select (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (< .cse30 .cse33))) (and (or (= .cse30 .cse31) (not .cse32)) (or (= .cse33 .cse31) .cse32)))) (not (< .cse33 c_~min2~0)))))))) .cse37) (or (not .cse37) (and (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse43 (select (store .cse42 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse44 (* ~M~0 4))) (let ((.cse39 (select .cse43 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (let ((.cse41 (select .cse43 (+ .cse44 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse38 (select (select .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse40 (< .cse41 .cse39))) (and (or (= .cse38 .cse39) .cse40) (or (= .cse38 .cse41) (not .cse40))))) (not (< .cse39 c_~min2~0))))))) (forall ((v_ArrVal_597 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_593)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_596))) (let ((.cse49 (select (store .cse48 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse50 (* ~M~0 4))) (or (let ((.cse47 (select .cse49 (+ .cse50 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse45 (< .cse47 c_~min2~0))) (and (or .cse45 (= .cse46 c_~min2~0)) (or (= .cse46 .cse47) (not .cse45))))) (< (select .cse49 (+ .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))))))))) (not (< .cse52 c_~min1~0))))))))) is different from false [2022-02-11 04:30:31,989 INFO L353 Elim1Store]: treesize reduction 78, result has 39.5 percent of original size [2022-02-11 04:30:31,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 2474 treesize of output 1245 [2022-02-11 04:30:32,145 INFO L353 Elim1Store]: treesize reduction 162, result has 26.7 percent of original size [2022-02-11 04:30:32,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93695 treesize of output 84500 [2022-02-11 04:30:32,662 INFO L353 Elim1Store]: treesize reduction 162, result has 26.7 percent of original size [2022-02-11 04:30:32,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91818 treesize of output 91223 [2022-02-11 04:30:35,520 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-02-11 04:30:35,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90554 treesize of output 89631 [2022-02-11 04:30:36,918 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:36,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89518 treesize of output 89302 [2022-02-11 04:30:37,318 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-02-11 04:30:37,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89302 treesize of output 88845 [2022-02-11 04:30:38,653 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:38,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88812 treesize of output 88452 [2022-02-11 04:30:39,046 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:39,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88452 treesize of output 88116 [2022-02-11 04:30:39,435 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:39,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88116 treesize of output 87732 [2022-02-11 04:30:39,847 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-02-11 04:30:39,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87732 treesize of output 76045 [2022-02-11 04:30:42,582 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-02-11 04:30:42,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73468 treesize of output 67677 [2022-02-11 04:30:45,196 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:45,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67236 treesize of output 62980 [2022-02-11 04:30:45,574 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:45,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62980 treesize of output 60548 [2022-02-11 04:30:45,945 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:45,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60548 treesize of output 57668 [2022-02-11 04:30:46,296 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-11 04:30:46,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57668 treesize of output 53316 [2022-02-11 04:30:46,599 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-11 04:30:46,618 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-02-11 04:30:46,804 WARN L452 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-02-11 04:30:46,804 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:308) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-11 04:30:46,811 INFO L158 Benchmark]: Toolchain (without parser) took 688668.36ms. Allocated memory was 204.5MB in the beginning and 815.8MB in the end (delta: 611.3MB). Free memory was 153.2MB in the beginning and 728.6MB in the end (delta: -575.4MB). Peak memory consumption was 509.5MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,811 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 04:30:46,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.49ms. Allocated memory is still 204.5MB. Free memory was 153.1MB in the beginning and 179.5MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.29ms. Allocated memory is still 204.5MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,812 INFO L158 Benchmark]: Boogie Preprocessor took 34.74ms. Allocated memory is still 204.5MB. Free memory was 177.4MB in the beginning and 176.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,812 INFO L158 Benchmark]: RCFGBuilder took 523.80ms. Allocated memory is still 204.5MB. Free memory was 175.8MB in the beginning and 157.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,812 INFO L158 Benchmark]: TraceAbstraction took 687882.71ms. Allocated memory was 204.5MB in the beginning and 815.8MB in the end (delta: 611.3MB). Free memory was 156.9MB in the beginning and 728.6MB in the end (delta: -571.7MB). Peak memory consumption was 513.4MB. Max. memory is 8.0GB. [2022-02-11 04:30:46,813 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 170.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.49ms. Allocated memory is still 204.5MB. Free memory was 153.1MB in the beginning and 179.5MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.29ms. Allocated memory is still 204.5MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.74ms. Allocated memory is still 204.5MB. Free memory was 177.4MB in the beginning and 176.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 523.80ms. Allocated memory is still 204.5MB. Free memory was 175.8MB in the beginning and 157.4MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 687882.71ms. Allocated memory was 204.5MB in the beginning and 815.8MB in the end (delta: 611.3MB). Free memory was 156.9MB in the beginning and 728.6MB in the end (delta: -571.7MB). Peak memory consumption was 513.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-11 04:30:46,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-11 04:30:47,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...